Abstract
In this chapter we extend the computational model of Section 2.2 with a new means of coordination. Until now processes coordinated with synchronized transitions and we have used transition labels to express which transitions should be taken together. In this chapter, we introduce guards, which are conditions on the global state and determine whether a specific local transition may be fired. We review results on systems with guards that contain quantifiers over all processes except the one evaluating the guard. Hence, the current state of other processes may restrict the control flow of a process. In contrast to synchronized transitions that, intuitively, link transitions of different processes, guards link transitions to the state of other processes.
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
© 2015 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bloem, R. et al. (2015). Guarded Protocols. In: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory. Springer, Cham. https://doi.org/10.1007/978-3-031-02011-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-02011-7_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-00883-2
Online ISBN: 978-3-031-02011-7
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 6