Processes as terms: non-well-founded models for bisimulation
- 1 June 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 2 (3) , 257-275
- https://doi.org/10.1017/s096012950000147x
Abstract
A compositional semantics characterizing bisimulation equivalence is derived from transition system specifications in the SOS style, satisfying certain syntactic syntactic conditions. We use Aczel's nonstandard set theory for solving a recursive equation for a domain fo processes. It contains non-well-founded elements modelling possibly infinite behaviour. Semantic interpretations of syntactic operators are obtained by defining the operational semantics for terms consisting of both syntactic and semantic (processes)entities. Finally, we return to standard set theory by observing that a similar, though less general, result can be obtained with the use of complete metric spaces.Keywords
This publication has 5 references indexed in Scilit:
- Non-well-founded sets obtained from ideal fixed pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A domain equation for bisimulationInformation and Computation, 1991
- Solving reflexive domain equations in a category of complete metric spacesJournal of Computer and System Sciences, 1989
- Processes and the denotational semantics of concurrencyInformation and Control, 1982
- Admissible Sets and StructuresPublished by Springer Nature ,1975