Bisimulations and predicate logic

Elementary (first-order) and nonelementary (set-theoretic) aspects of the largest bisimulation are considered with a view toward analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding over certain transition predicates computable in log space), and (ii) as a tool for analyzing the dependence of transitions on data (which can be shown to be elementary or nonelementary, depending on the formulation of the transitions).

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

[2]  Philippe Darondeau,et al.  Proof Systems for Infinite Behaviours , 1992, Inf. Comput..

[3]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

[4]  H. Friedman.  Recursiveness in ¹₁ paths through , 1976 .

[5]  Tim Fernando.  Comparative Transition System Semantics , 1992, CSL.

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

[7]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[8]  Serge Grigorieff,et al.  Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n)) , 1990, Journal of Symbolic Logic.

[9]  Frits W. Vaandrager,et al.  Expressiveness results for process algebras , 1993 .

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

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

[12]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[13]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[14]  Solomon Feferman,et al.  Incompleteness along paths in progressions of theories , 1962, Journal of Symbolic Logic.

[15]  Tim Fernando,et al.  Transition Systems and Dynamic Semantics , 1992, JELIA.

[16]  K. BenthemvanJ.F.A..  Language in Action. Categories, Lambdas and Dynamic Logic , 1991 .

[17]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[18]  Frits W. Vaandrager,et al.  Turning SOS rules into equations , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

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

[20]  Faron Moller,et al.  Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

[22]  Yiannis N. Moschovakis,et al.  The next admissible set , 1971, Journal of Symbolic Logic.

[23]  Wojciech Sachwanowicz.  Forcing and the Omitting Types Theorem For Lt , 1986, Math. Log. Q..

[24]  H. Keisler.  Fundamentals of Model Theory , 1977 .

[25]  Philippe Darondeau,et al.  Concurrency and Computability , 1990, Semantics of Systems of Concurrent Processes.