Coverability, Termination, and Finiteness in Recursive Petri Nets
From MaRDI portal
Publication:5025058
DOI10.3233/FI-2021-2081MaRDI QIDQ5025058
Igor Khmelnitsky, Serge Haddad, Alain Finkel
Publication date: 1 February 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.06804
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri nets and regular languages
- A structure to decide reachability in Petri nets
- The covering and boundedness problems for vector addition systems
- A remark on the time complexity of the subtree problem
- The emptiness problem for valence automata or: another decidable extension of Petri nets
- On the coverability and reachability languages of monotonic extensions of Petri nets
- The covering and boundedness problems for branching vector addition systems
- Ordinal theory for expressiveness of well-structured transition systems
- Recursive Petri nets
- Well-structured languages
- Model Checking Vector Addition Systems with one zero-test
- Nonelementary Complexities for Branching VASS, MELL, and Extensions
- The Reachability Problem for Vector Addition System with One Zero-Test
- Trace Inclusion for One-Counter Nets Revisited
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
- An Algorithm for the General Petri Net Reachability Problem
- Concurrently controlled grammars
- The Complexity of Coverability in ν-Petri Nets
- Reachability in Petri Nets with Inhibitor Arcs
- The reachability problem for Petri nets is not elementary
- A helpful result for proving inherent ambiguity
- Well-structured transition systems everywhere!
This page was built for publication: Coverability, Termination, and Finiteness in Recursive Petri Nets
