Modal Logic, Transition Systems and Processes

Transition systems can be viewed either as process diagrams or as Kripke structures. The rst perspective is that of process theory, the second that of modal logic. This paper shows how various formalisms of modal logic can be brought to bear on processes. Notions of bisimulation can not only be motivated by operations on transition systems, but they can also be suggested by investigations of modal formalisms. To show that the equational view of processes from process algebra is closely related to modal logic, we consider various ways of looking at the relation between the calculus of basic process algebra and propositional dynamic logic. More concretely, the paper contains preservation results for various bisimulation notions, a result on the expressive power of propositional dynamic logic, and a deenition of bisimulation which is the proper notion of invariance for concurrent propositional dynamic logic.

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

[2]  M. de Rijke,et al.  The Modal Logic of Inequality , 1992, J. Symb. Log..

[3]  Jan A. Bergstra,et al.  A complete inference system for rgular processes with silent moves , 1984 .

[4]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[5]  John L. Pollock,et al.  Basic modal logic , 1967, Journal of Symbolic Logic.

[6]  Yde Venema,et al.  Many-dimensional Modal Logic , 1991 .

[7]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

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

[9]  Henrik Sahlqvist Completeness and Correspondence in the First and Second Order Semantics for Modal Logic , 1975 .

[10]  David Peleg,et al.  Concurrent dynamic logic , 1985, STOC '85.

[11]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[12]  Jan A. Bergstra,et al.  Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator , 1987, Comput. J..

[13]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[14]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[15]  Jan A. Bergstra,et al.  Logic of transition systems , 1994, J. Log. Lang. Inf..

[16]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[17]  R. J. van Glabbeek,et al.  Comparative Concurrency Semantics and Refinement of Actions , 1996 .

[18]  R. Labrecque The Correspondence Theory , 1978 .

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

[20]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[21]  R. Goldblatt Logics of Time and Computation , 1987 .

[22]  Johan van Benthem,et al.  A note on dynamic arrow logic , 1994 .

[23]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[24]  J.F.A.K. van Benthem,et al.  Language in Action: Categories, Lambdas and Dynamic Logic , 1997 .

[25]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[26]  K. Fine Some Connections Between Elementary and Modal Logic , 1975 .

[27]  Jan A. Bergstra,et al.  Algebra of Communicating Processes , 1995, Workshops in Computing.

[28]  Tim Fernando,et al.  Bisimulations and predicate logic , 1994, Journal of Symbolic Logic.

[29]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

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

[31]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.