Article contents
Bisimulations and predicate logic
Published online by Cambridge University Press: 12 March 2014
Abstract
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).
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1994
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027022558301-0594:S0022481200019617_inline1.gif?pub-status=live)
- 5
- Cited by