Abstract
Employing the notion of a transition system, programs, conceived as binary (transition) relations on states, are related to processes, viewed as dynamic states. The comparative study is carried out syntactically over rules for transitions, and semantically in terms of bisimulation equivalence. A certain form of transitions is studied, and a “logical” approach to the notion of a bisimulation is taken that are somewhat non-standard (but, it is hoped, illuminating). Sequential composition, non-deterministic choice, iteration, and interleaving are analyzed alongside a notion of data. Atomization and synchronization are also considered.
My thanks to Jan Willem Klop for suggesting that a report entitled “Comparative transition system semantics” be written, and for help along the way; also to Jan Rutten, Daniele Turi, Alban Ponse, Frits Vaandrager, Johan van Benthem, Prakash Panangaden, Fer-Jan de Vries, Jan van Eijck, and Franck van Breugel for useful discussions. The work was funded by the Netherlands Organization for Scientific Research (NWO project NF 102/62-356, ‘Structural and Semantic Parallels in Natural Languages and Programming Languages’).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Peter Aczel. Non-Well-Founded Sets. CSLI Lecture Notes Number 14, Stanford, 1988.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
J.W. de Bakker and E.P. de Vink. Bisimulation semantics for concurrency with atomicity and action refinement. Technical Report CS-R9210, Centre for Mathematics and Computer Science, 1992.
Jon Barwise. Admissible Sets and Structures. Springer-Verlag, Berlin, 1975.
G. Boudol and I. Castellani. Concurrency and atomicity. Theoretical Computer Science, 59, 1988.
F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures in a paradigm for asynchronous communication. In Proc. Concur '91, LNCS 527. Springer-Verlag, Berlin, 1991.
Tim Fernando. A primitive recursive set theory and AFA: on the logical complexity of the largest bisimulation. To appear in the proceedings of Computer Science Logic '91 (Berne).
Tim Fernando. Between programs and processes: absoluteness and open ended-ness. Technical Report IAM 92-011, Institut für Informatik, Universität Bern, 1992.
J.F. Groote and A. Ponse. Process algebra with guards: combining Hoare logic with process algebra. In Proc. Concur '91, LNCS 527. Springer-Verlag, Berlin, 1991.
J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. In Proc. 16th ICALP, LNCS 372. Springer-Verlag, Berlin, 1989.
David Harel. Dynamic logic. In Gabbay et al, editor, Handbook of Philosophical Logic, Volume 2. D. Reidel, 1984.
Robin Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25, 1983.
David Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proc. 5th GI Conference, LNCS 104. Springer-Verlag, Berlin, 1981.
David Peleg. Concurrent dynamic logic. J. Assoc. Computing Machinery, 34(2), 1987.
Gordon D. Plotkin. A powerdomain construction. SIAM J. Comput., 5(3), 1976.
J.J.M.M. Rutten. Processes as terms: Non-well-founded models for bisimulation, 1992. To appear in Mathematical Structures in Computer Science.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernando, T. (1993). Comparative transition system semantics. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_11
Download citation
DOI: https://doi.org/10.1007/3-540-56992-8_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56992-3
Online ISBN: 978-3-540-47890-4
eBook Packages: Springer Book Archive