Abstract
A concurrent system is persistent if throughout its operation no activity which became enabled can subsequently be prevented from being executed by any other activity. This is often a highly desirable (or even necessary) property; in particular, if the system is to be implemented in hardware. Over the past 40 years, persistence has been investigated and applied in practical implementations assuming that each activity is a single atomic action which can be represented, for example, by a single transition of a Petri net. Recently, it turned out that to deal with the synthesis of GALS systems one also needs to consider activities represented by steps, each step being a set of simultaneously executed transitions. Moving into the realm of step based execution, semantics creates a wealth of new fundamental problems and questions. In particular, there are different ways in which the standard notion of persistence could be lifted from the level of sequential semantics to the level of step semantics. Moreover, one may consider steps which are persistent and cannot be disabled by other steps, as well as steps which are nonviolent and cannot disable other steps. In this paper, we provide a classification of different types of persistence and nonviolence, both for steps and markings of pt-nets. We also investigate behavioural and structural properties of such notions.
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.
References
Barylska, K., Ochmański, E.: Levels of persistency in Place/Transition nets. Fundamenta Informaticae 93, 33–43 (2009)
Barylska, K., Mikulski, Ł., Ochmański, E.: On persistent reachability in Petri nets. Information and Computation 223, 67–77 (2013)
Best, E., Darondeau, P.: Decomposition theorems for bounded persistent petri nets. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 33–51. Springer, Heidelberg (2008)
Best, E., Darondeau, P.: Separability in persistent Petri nets. Fundamenta Informaticae 113, 179–203 (2011)
Dasgupta, S., Potop-Butucaru, D., Caillaud, B., Yakovlev, A.: Moving from weakly endochronous systems to delay-insensitive circuits. Electronic Notes in Theoretical Computer Science 146, 81–103 (2006)
Fernandes, J., Koutny, M., Pietkiewicz-Koutny, M., Sokolov, D., Yakovlev, A.: Step persistence in the design of GALS systems. Technical Report 1349, School of Computing Science, Newcastle University (2012)
Landweber, L.H., Robertson, E.L.: Properties of conflict-free and persistent Petri nets. Journal of the ACM 25, 352–364 (1978)
Yakovlev, A., Koelmans, A., Semenov, A., Kinniment, D.: Modelling, analysis and synthesis of asynchronous control circuits using Petri nets. INTEGRATION, the VLSI Journal 21, 143–170 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koutny, M., Mikulski, Ł., Pietkiewicz-Koutny, M. (2013). A Taxonomy of Persistent and Nonviolent Steps. In: Colom, JM., Desel, J. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2013. Lecture Notes in Computer Science, vol 7927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38697-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-38697-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38696-1
Online ISBN: 978-3-642-38697-8
eBook Packages: Computer ScienceComputer Science (R0)