Abstract
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They differ for the choice of a derived versus a primitive notion of event which induces considerable differences and makes the two models suitable for different purposes. This opens the problem of investigating their mutual relationships, to which this paper gives a fully comprehensive answer.
In details, we characterise the category of extensional asynchronous transitions systems as the largest full subcategory of the category of (labelled) asynchronous transition systems which admits TSI, the category of transition systems with independence, as a coreflective subcategory. In addition, we introduce event-maximal asynchronous transitions systems and we show that their category is equivalent to TSI, so providing an exhaustive characterisation of transition systems with independence in terms of asynchronous transition systems.
This author was supported by EU Human Capital and Mobility grant Erbchbgct920005.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. A. Bednarczyk. Categories of asynchronous systems PhD thesis in Computer Science, University of Sussex (1988), report no. 1/88.
J.M.C. Baeten and W.P. Weijland. Process Algebra Cambridge Tracts in Theoretical Computer Science, 18 (1990), Cambridge University Press.
G-L. Cattani and V. Sassone. Higher Dimensional Transition Systems, To appear in Proceedings of LICS 96 (1996), IEEE Computer Society Press.
R. van Glabbeek. Bisimulations for higher dimensional automata, email message sent to the Concurrency mailing list on July 7, 1991. Available at http://theory.stanford.edu/people/rvg/hda.
R. van Glabbeek and G. Plotkin. Configuration Structures. In Proceedings of LICS'95, D. Kozen (Ed.), IEEE Computer Society Press (1995), 99–109.
E. Goubault. Domains of Higher-Dimensional Automata. In Proceedings of CONCUR'93, E. Best (Ed.), LNCS 715 (1993), Springer-Verlag, 293–307.
E. Goubault and T. Jensen. Homology of Higher-Dimensional Automata. In Proceedings of CONCUR'92, W.R. Cleaveland (Ed.), LNCS 630 (1992), Springer-Verlag, 254–268.
P. Godefroid and P. Wolper. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties, In Proceedings of CAV'91, K.G. Larsen et al. (Eds.), LNCS 575 (1991), Springer-Verlag, 332–342.
M. Hennessy. Algebraic Theory of Processes. Series in the Foundations of Computing (1988), The MIT Press.
C.A.R. Hoare. Communicating Sequential Processes. Series in Computer Science (1985), Prentice-Hall.
R. Milner. Communication and Concurrency. Series in Computer Science (1989), Prentice Hall.
R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification, F.L. Bauer et al. (Eds.), Springer-Verlag, (1993).
M. Mukund. Petri Nets and Step Transition Systems. International Journal of Foundations of Computer Science, vol. 3, n. 4 (1992), 443–478.
M. Mukund and M. Nielsen. CCS, Locations and Asynchronous Transition Systems In Proceedings of FST & TCS'92, R. Shyamasundar (Ed.), LNCS n. 652 (1992), Springer-Verlag, 328–341.
M. Nielsen, V. Sassone and G. Winskel. Relationships between Models of Concurrency, In Proceedings of REX'93. A Decade of Concurrency: Reflections and Perspectives, LNCS n. 803, (1994), J.W. de Bakker et al. (Eds.), Springer-Verlag, 425–476.
D. Peled. All from One, One for All: On Model Checking Using Representatives, In Proceedings of CAV'93, C. Courcoubetis (Ed.), LNCS n. 697 (1993), Springer-Verlag, 409–423.
V. Pratt. Modelling Concurrency with Geometry. In Proceedings of 18th ACM Symposium on Principles of Programming Languages, ACM Press, (1991), 311–322.
V. Sassone, M. Nielsen, and G. Winskel. Models for Concurrency: Towards a Classification. To appear in Theoretical Computer Science. An extended abstract appears as ‘A Classification of Models for Concurrency’ in Proceedings of CONCUR'93, E. Best (Ed.), LNCS 715 (1993), Springer-Verlag, 82–96.
M.W. Shields. Concurrent machines Theoretical Computer Science n.28 (1985), 449–465.
A. Valmari. A Stubborn attack on state explosion, In Proceedings of CAV'90, DIMACS Series n. 3 (1991), 25–42.
G. Winskel and M. Nielsen. Models for Concurrency In Handbook of Logic and the Foundations of Computer Science, vol. IV, S. Abramsky et al. (Eds.), Oxford University Press, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hildebrandt, T.T., Sassone, V. (1996). Comparing transition systems with independence and asynchronous transition systems. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_49
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive