In this chapter, we cover
-
State machines
-
Process algebras (including the φ-calculus)
-
Linda
-
Deadlock once again, considering tools such as FDR2 and Spin, which can be used to check for deadlocks
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
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2008). Models of Concurrency. In: Practical Distributed Processing. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84628-841-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-84628-841-8_3
Publisher Name: Springer, London
Print ISBN: 978-1-84628-840-1
Online ISBN: 978-1-84628-841-8
eBook Packages: Computer ScienceComputer Science (R0)