On Yen's Path Logic for Petri Nets

Authors:
Mohamed Faouzi Atig;Peter Habermehl
Affiliations:
LIAFA, CNRS & Univ. of Paris 7, Case 7014, Paris 13, France 75205;LIAFA, CNRS & Univ. of Paris 7, Case 7014, Paris 13, France 75205
Venue:
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Year:
2009

Citing 10
Cited 4

A structure to decide reachability in Petri nets

Theoretical Computer Science
A unified approach for deciding the existence of certain Petri net paths

Information and Computation
A note on fine covers and iterable factors of VAS languages

Information Processing Letters
On the regularity of Petri net languages

Information and Computation
A Fundamental Tehoerem of Asynchronous Parallel Computation

Proceedings of the Sagamore Computer Conference on Parallel Processing
On the Decidability of Model Checking for Several µ-calculi and Petri Nets

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Checking Linear Temporal Formulas on Sequential Recursive Petri Nets

TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Verifying liveness for asynchronous programs

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Energy games in multiweighted automata

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Algorithmic verification of asynchronous programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
The covering and boundedness problems for branching vector addition systems

Journal of Computer and System Sciences
On selective unboundedness of VASS

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is expspace -complete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we salvage almost all of Yen's results by defining a fragment of this class of formulas for which the satisfiability problem is expspace -complete by adapting his proof.