On Compositionality of Boundedness and Liveness for Nested Petri Nets
2012; IOS Press; Volume: 120; Issue: 3-4 Linguagem: Inglês
10.3233/fi-2012-762
ISSN1875-8681
AutoresLeonid W. Dworzański, Irina A. Lomazova,
Tópico(s)Business Process Modeling and Analysis
ResumoNested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [14]. Boundedness is in EXPSPACE and liveness is in EXPSPACE or worse for plain Petri nets [6]. However, for some
Referência(s)