Abstract
In this paper we show that the notion of bisimulation for a class of labelled transition systems (the class of nondeterministic processes) may be restated as one of “reducibility to a same system” via a simple reduction relation. The reduction relation is proven to enjoy some desirable properties, notably a Church-Rosser property. We also show that, when restricted to finite nondeterministic processes, the relation yields unique minimal forms for processes and can be characterised algebraically by a set of reduction rules.
Supported by a scholarship from the Consiglio Nazionale delle Ricerche (Italy)
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Brookes, C. Rounds (1983), “Behavioural Equivalence Relations induced by Program Logics”, in Proc. ICALP '83, LNCS 154.
Full version of this paper. Contact the author.
I. Castellani, P. Franceschi, U. Montanari (1982), “Labelled Event Structures: A Model for Observable Concurrency”, in: D. Bjorner (ed.):Proc. IFIP TC2 Working Conference on Formal Description of Programming Concepts II, Garmisch, June 1982: North-Holland Publ. Company 1983
R. De Nicola (1984), “Behavioural Equivalences for Transition Systems”, Internal Report I.E.I., Pisa, Italy.
M. Hennessy, R. Milner (1983), “Algebraic laws for Nondeterminism and Concurrency”, Technical Report: CSR-133-83, University of Edinburgh.
R. Keller (1976), “Formal verification of Parallel Programs”, Communications of the ACM n. 19, Vol. 7.
R. Milner (1980), A Calculus of Communicating Systems, LNCS 92.
R. Milner (1982), “Calculi for Synchrony and Asynchrony”, J. Theoretical Computer Science, Vol. 25.
D. Park (1981), “Concurrency and Automata on Infinite Sequences”, in LNCS 104.
G. Plotkin (1981), “A Structured Approach to Operational Semantics”, DAIMI FN-19, Computer Science Dept, Aarhus University.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castellani, I. (1985). Bisimulations and abstraction homomorphisms. In: Ehrig, H., Floyd, C., Nivat, M., Thatcher, J. (eds) Mathematical Foundations of Software Development. CAAP 1985. Lecture Notes in Computer Science, vol 185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15198-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-15198-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15198-2
Online ISBN: 978-3-540-39302-3
eBook Packages: Springer Book Archive