On Yen's path logic for Petri nets

International Journal of Foundations of Computer Science

Volumn 22, Issue 4, 2011, Pages 783-799

  Atig, Mohamed Faouzi ^a   Habermehl, Peter ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

path logic; Petri nets; reachability problem

Indexed keywords

EID: 79958810700     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054111008428     Document Type: Conference Paper

References (21)

1. Eike Best and Agathe Merceron. Frozen tokens and d-continuity: A study in relating system properties to process properties. In European Workshop on Applications and Theory in Petri Nets 1984, volume 188 of Lecture Notes In Computer Science, pages 48-61. Springer, 1985.
2. Javier Esparza. On the decidability of model checking for several μ-calculi and Petri nets. In CAAP, volume 787 of Lecture Notes in Computer Science, pages 115-129. Springer, 1994.
3. Javier Esparza and Mogens Nielsen. Decidability issues for Petri nets - a survey. Bulletin of the EATCS, 52:244-262, 1994.
4. Pierre Ganty, Rupak Majumdar, and Andrey Rybalchenko. Verifying liveness for asynchronous programs. In POPL, pages 102-113. ACM, 2009.
5. M.H.T. Hack. Decidability questions for Petri nets. PhD thesis, M.I.T, 1976.
6. Serge Haddad and Denis Poitrenaud. Checking linear temporal formulas on sequential recursive Petri nets. In TIME, pages 198-205, 2001.
7. Rodney R. Howell, Louis E. Rosier and Hsu-Chun Yen. A taxonomy of fairness and temporal logic problems for Petri nets. Theor. Comput. Sci., 82(2): 341-372, 1991.
8. Dung T. Huynh. The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems. In STOC, pages 405-412, ACM, 1985.
9. Robert M. Keller. A fundamental theorem of asynchronous parallel computation. In Sagamore Computer Conference, volume 24 of Lecture Notes in Computer Science, pages 102-112. Springer, 1974.
10. S. Rao Kosaraju. Decidability of reachability in vector addition systems (preliminary version). In STOC, pages 267-281. ACM, 1982.
11. J. L. Lambert. A structure to decide reachability in Petri nets. Theor. Comput. Sci., 99(1):79-104, 1992.
12. R. Lipton. The reachability problem requires exponential time. Technical Report TR 66, 1976.
13. Ernst W. Mayr. An algorithm for the general Petri net reachability problem. In STOC, pages 238-246. ACM, 1981.
14. Ernst W. Mayr. Persistence of vector replacement systems is decidable. Acta Inf., 15:309-318, 1981.
15. Charles Rackoff. The covering and boundedness problems for vector addition systems. Theor. Comput. Sci., 6:223-231, 1978.
16. Ichiro Suzuki and Tadao Kasami. Three measures for synchronic dependence in Petri nets. Acta Informaticae, 19: 325-338, 1983. (Pubitemid 14468432)
17. Rüdiger Valk and Mathias Jantzen. The residue of vector sets with applications to decidability problems in Petri nets. Acta Informaticae, 21: 643-674, 1985. (Pubitemid 15566994)
18. Rüdiger Valk and Guy Vidal-Naquet. Petri nets and regular languages. J. Comput. Syst. Sci., 23(3): 299-325, 1981.
19. Hsu-Chun Yen. A unified approach for deciding the existence of certain Petri net paths. Inf. Comput., 96(1):119-137, 1992.
20. Hsu-Chun Yen. A note on fine covers and iterable factors of vas languages. Inf. Process. Lett., 56(5):237-243, 1995.
21. Hsu-Chun Yen. On the regularity of Petri net languages. Inf. Comput., 124(2):168-181, 1996. (Pubitemid 126412203)