Journal of Symbolic Logic

Bisimulations and Predicate Logic

Tim Fernando

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

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 $\Pi^1_1$ 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).

Article information

Source
J. Symbolic Logic, Volume 59, Issue 3 (1994), 924-944.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183744558

Mathematical Reviews number (MathSciNet)
MR1295979

Zentralblatt MATH identifier
0809.03018

JSTOR
links.jstor.org

Citation

Fernando, Tim. Bisimulations and Predicate Logic. J. Symbolic Logic 59 (1994), no. 3, 924--944. https://projecteuclid.org/euclid.jsl/1183744558


Export citation