Abstract
This is an abstract of [1], a brief note describing the path of ideas that lead from the theory of true concurrency, a semantic theory about the nature of concurrent computation, to the unfolding approach to model-checking, a pragmatic technique for palliating the state-explosion problem in automatic verification. While the note provides a very incomplete and hence “false” view of true concurrency, it also includes several pages of references.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Esparza, J.: A False History of True Concurrency: from Petri to Tools. In: Weber, M. (ed.) SPIN 2010. LNCS, vol. 6349, pp. 180–186. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esparza, J. (2010). A False History of True Concurrency: From Petri to Tools. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-15928-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15927-5
Online ISBN: 978-3-642-15928-2
eBook Packages: Computer ScienceComputer Science (R0)