Zusammenfassung
Wir zeigen, wie die Entscheidungsprobleme der Überdeckung, der Beschränktheit und der Erreichbarkeit mithilfe induktiver Invarianten einfacher lösbar sind als mit herkömmlichen Methoden.
References
Abdulla PA, Jonsson B (1996) Verifying programs with unreliable channels. Inf Comput 127(2):91–101
Bouziane Z (1998) A primitive recursive algorithm for the general petri net reachability problem. FOCS 1998:130–136
Bozzelli L, Ganty P (2011) Complexity analysis of the backward coverability algorithm for vass. In: Delzanno G, Potapov I (eds) Reachability Problems – 5th International Workshop, RP 2011, Genoa, Italy, September 28–30, 2011. Proceedings, Lecture Notes in Computer Science, vol 6945, Springer, 96–109
Cardoza E, Lipton RJ, Meyer AR (1976) Exponential space complete problems for Petri nets and commutative semigroups: Preliminary report. In STOC’76, ACM, 50–54
Demri S (2010) On selective unboundedness of vass. In: Chen YF, Rezine A (eds) Proceedings 12th International Workshop on Verification of Infinite-State Systems, EPTCS, vol 39, 1–15
Figueira D, Figueira S, Schmitz S, Schnoebelen P (2011) Ackermannian and primitive-recursive bounds with dickson’s lemma. In: Logic in Computer Science (LICS), 26th Annual IEEE Symposium, 269–278
Finkel A (1993) The minimal coverability graph for petri nets. In: Rozenberg G (ed) Advances in Petri Nets 1993. Lect Notes Comp Sci, vol 674, Springer, 210–243
Finkel A, Schnoebelen Ph (2001) Well-structured transition systems everywhere! Theoret Comput Sci 256:63–92
Finkel A, Goubault-Larrecq J (2009) Forward analysis for WSTS, Part I: Completions. In: Albers S, Marion JY (eds) 26th Symp on Theoretical Aspects of Computer Science, STACS’09, Springer, 433–444
Finkel A, Goubault-Larrecq J (2009) Forward analysis for WSTS, Part II: Complete WSTS. In: Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas SE, Thomas W (eds) 36th Int. Colloquium on Automata, Languages and Programming, ICALP’09. Lect. Notes Comp Sci, vol 5556, Springer, 188–199
Hopcroft JE, Pansiot JJ (1979) On the reachability problem for 5-dimensional vector addition systems. Theor Comput Sci 8:135–159
Jančar P (2008) Bouziane’s transformation of the petri net reachability problem and incorrectness of the related algorithm. Inf Comput 206:1259–1263
Leroux J (2012) Vector addition systems reachability problem (a simpler solution). In: Voronkov A (ed) The Alan Turing Centenary Conference, Turing-100, Manchester UK June 22–25, 2012, Proceedings. EPiC Series, vol 10, EasyChair, 214–228
Mayr EW, Meyer AR (1981) The complexity of the finite containment problem for petri nets. J ACM 28(3):561–576
Pachl JK (2003) Reachability problems for communicating finite state machines. CoRR cs.LO/0306121
Rackoff C (1978) The covering and boundedness problems for vector addition systems. Theoret Comput Sci 6(2):223–231
Schnoebelen Ph (2010) Lossy counter machines decidability cheat sheet. In: Kucera A, Potapov I (eds) Proceedings of the 4th Workshop on Reachability Problems in Computational Models (RP’10). Volume 6227 of Lecture Notes in Computer Science, Brno, Czech Republic, Springer, 51–75
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Finkel, A., Leroux, J. Neue, einfache Algorithmen für Petrinetze. Informatik Spektrum 37, 229–236 (2014). https://doi.org/10.1007/s00287-013-0753-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00287-013-0753-5