Graded Modalities and Resource Bisimulation

The logical characterization of the strong and the weak (ignoring silent actions) versions of resource bisimulation are studied. The temporal logics we introduce are variants of Hennessy-Milner Logics that use graded modalities instead of the classical box and diamond operators. The considered strong bisimulation induces an equivalence that, when applied to labelled transition systems, permits identifying all and only those systems that give rise to isomorphic unfoldings. Strong resource bisimulation has been used to provide nondeterministic interpretation of finite regular expressions and new axiomatizations for them. Here we generalize this result to its weak variant.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[3]  Rocco De Nicola,et al.  Models of Nondeterministic Regular Expressions , 1999, J. Comput. Syst. Sci..

[4]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[5]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[6]  Rocco De Nicola,et al.  Tree Morphisms and Bisimulations , 1998, Electron. Notes Theor. Comput. Sci..

[7]  Rocco De Nicola,et al.  A finite axiomatization of nondeterministic regular expressions , 1999, RAIRO Theor. Informatics Appl..

[8]  Rocco De Nicola,et al.  Fully Abstract Models for Nondeterministic Regular Expressions , 1995, CONCUR.

[9]  Jos C. M. Baeten,et al.  Basic process algebra , 1990 .

[10]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[11]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

[12]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[13]  Maurizio Fattorosi-Barnaba,et al.  Graded modalities. I , 1985, Stud Logica.

[14]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[15]  Jan A. Bergstra,et al.  Process Algebra with a Zero Object , 1990, CONCUR.

[16]  P.R.J. Asveld.  Review of "R.J.H. van Glabbeek, Comparative Concurrency Semantics and Refinement Actions (1996), CWI, Amsterdam" , 1997 .

[17]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[18]  R. J. vanGlabbeek.  Comparative concurrency semantics and refinement of actions , 1996 .

[19]  Arto Salomaa,et al.  Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

[20]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[21]  Giovanna DAgostino.  Modal Logic and non-well-founded Set Theory: translation, bisimulation, interpolation , 1998 .