Decidability of a temporal logic problem for Petri nets

DOI10.1016/0304-3975(90)90006-4zbMath0701.68081OpenAlexW1964087553MaRDI QIDQ914407

Petr Jančar

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90006-4

zbMATH Keywords

fairnessparallel systemsplace/transition Petri nets

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (13)

Unnamed Item ⋮ Constrained properties, semilinear systems, and Petri nets ⋮ Petri nets and regular processes ⋮ Undecidability of bisimilarity for Petri nets and some related problems ⋮ Ensuring completeness of symbolic verification methods for infinite-state systems ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ On the complexity of resource-bounded logics ⋮ Petri nets with name creation for transient secure association ⋮ Minimal Cost Reachability/Coverability in Priced Timed Petri Nets ⋮ Model checking of systems with many identical timed processes ⋮ Process rewrite systems. ⋮ Algorithmic analysis of programs with well quasi-ordered domains. ⋮ A taxonomy of fairness and temporal logic problems for Petri nets

Cites Work

• An Algorithm for the General Petri Net Reachability Problem
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of a temporal logic problem for Petri nets