Some decision problems related to the reachability problem for Petri nets

DOI10.1016/0304-3975(76)90067-0zbMath0352.68083OpenAlexW2084570980WikidataQ56170367 ScholiaQ56170367MaRDI QIDQ1235983

Tadao Kasami, Toshiro Araki

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90067-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Related Items (17)

Discrete Parameters in Petri Nets ⋮ Recursivite et cônes rationnels fermés par intersection ⋮ Unnamed Item ⋮ A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets ⋮ ML and Extended Branching VASS ⋮ Directed reachability for infinite-state systems ⋮ Verification of membrane systems with delays via Petri nets with delays ⋮ A well-structured framework for analysing Petri net extensions ⋮ Well-structured transition systems everywhere! ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ Decidable problems on the strong connectivity of Petri net reachability sets ⋮ Weak and Nested Class Memory Automata ⋮ Three measures for synchronic dependence in Petri nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Expand, enlarge and check: new algorithms for the coverability problem of WSTS ⋮ Synthesis of (choice-free) reset nets

Cites Work

• Parallel program schemata
• Reachability Problems in Vector Addition Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Some decision problems related to the reachability problem for Petri nets