Abstract
FNM is extended with a construct for atomic tests, which is exploited to check the absence of those parallel processes whose presence may impede the executability of the current transition. The effect is that parallel composition is no longer a permissive operator, as different parallel contexts may enable or disable the transitions performable by some component. The resulting language, called Non-permissive Petri net Language (NPL for short), is Turing-complete and represents the class of finite Nonpermissive Petri nets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Gorrieri, R. (2017). Adding Atomic Tests for Absence: NPL. In: Process Algebras for Petri Nets. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-55559-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-55559-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55558-4
Online ISBN: 978-3-319-55559-1
eBook Packages: Computer ScienceComputer Science (R0)