Abstract
We consider Nested Petri nets (NP-nets), i.e. Petri nets in which tokens can be Petri nets themselves. To increase flexibility and give tools for modeling adaptive processes we extend this formalism by allowing operations on net tokens. We prove decidability of some crucial for verification problems and thus show that, in spite of very flexible structure, NP-nets maintain "good" properties of ordinary Petri nets. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Lomazova, I. A. (2008). Nested petri nets for adaptive process modeling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4800 LNCS, pp. 460–474). https://doi.org/10.1007/978-3-540-78127-1_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
