Abstract
In this chapter we make a tour of Petri nets, one of the oldest and most interesting concurrency model. Our aim here is rather modest. Indeed, the chapter is mainly devoted to the presentation of concurrent regular expressions; this is an extension of regular expressions with parallel operators. The choice is motivated by the strong relationship between classical regular expressions and network algebra, documented in Chapters 6 and 8.
It does not take much strength to do things, but it requires great strength to decide what to do.
Herbert Hubbard
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London
About this chapter
Cite this chapter
Ştefănescu, G. (2000). Petri nets. In: Network Algebra. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0479-7_12
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0479-7_12
Publisher Name: Springer, London
Print ISBN: 978-1-85233-195-5
Online ISBN: 978-1-4471-0479-7
eBook Packages: Springer Book Archive