On Yen's Path Logic for Petri Nets

Atig, Mohamed Faouzi; Habermehl, Peter

doi:10.1142/s0129054111008428

Cited by 31 publications

(71 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [25], Yen extends the induction strategy used by Rackoff in [21] to give Expspace upper bound for deciding many other properties. Another work closely related to Yen's above work is [1].…”

Section: Introductionmentioning

confidence: 92%

See 1 more Smart Citation

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier

Praveen

2012

Algorithmica

View full text Add to dashboard Cite

Abstract. The coverability and boundedness problems for Petri nets are known to be Expspacecomplete. Given a Petri net, we associate a graph with it. With the vertex cover number k of this graph and the maximum arc weight W as parameters, we show that coverability and boundedness are in ParaPspace. This means that these problems can be solved in space O (ef (k, W )poly(n)), where ef (k, W ) is some exponential function and poly(n) is some polynomial in the size of the input. We then extend the ParaPspace result to model checking a logic that can express some generalizations of coverability and boundedness.

show abstract

Section: Introductionmentioning

confidence: 92%

“…Let e ∈ N be any number and σ be a firing sequence. Suppose during the firing of σ, there are intermediate markings M 1 and There can be at most (2…”

Section: Vertex Cover For Petri Netsmentioning

confidence: 99%

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier

Praveen

2012

Algorithmica

View full text Add to dashboard Cite

show abstract

“…Still in the convergent case, Proposition 5.4 also eschews an issue in a very recent article of Yin and Lafortune [34], which claims the same EXPSPACE upper bound for dynamic diagnosability, but relies crucially on a flawed result of Yen debunked by Atig and Habermehl [35].…”

Section: Trace-diagnosabilitymentioning

confidence: 99%

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Bérard¹,

Haar

Schmitz

et al. 2018

View full text Add to dashboard Cite

Abstract. Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues.We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general Petri nets and to opacity questions.Second, we provide a global picture of complexity results for the verification of diagnosability and opacity. We show that diagnosability is NL-complete for finite state systems, PSPACE-complete for safe convergent Petri nets (even with fairness), and EXPSPACE-complete for general Petri nets without fairness, while non diagnosability is inter-reducible with reachability when fault events are not weakly fair. Opacity is ESPACE-complete for safe Petri nets (even with fairness) and undecidable for general Petri nets already without fairness.

show abstract

“…The second component is unbounded from (2) and q ∈ {q 0 , q 1 } exists. Indeed, in order to increment the second component, the first component needs first to be incremented.…”

Section: Witness Runs For Simultaneous Unboundednessmentioning

confidence: 99%

“…To do so, we introduce the generalized unboundedness problem in which many problems can be captured such as the reversal-boundedness detection problems, the boundedness problem, the place boundedness problem, termination, strong promptness detection problem, regularity detection and many other decision problems on VASS. We show that this problem can be solved in exponential space by adapting [45] even though it does not fall into the class of increasing path formulae recently introduced in [3,2] (see Theorem 4.6). 3.…”

Section: Introductionmentioning

confidence: 99%

On Selective Unboundedness of VASS

Demri

2010

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Numerous properties of vector addition systems with states amount to checking the (un)boundedness of some selective feature (e.g., number of reversals, counter values, run lengths). Some of these features can be checked in exponential space by using Rackoff's proof or its variants, combined with Savitch's Theorem. However, the question is still open for many others, e.g., regularity detection problem and reversal-boundedness detection problem. In the paper, we introduce the class of generalized unboundedness properties that can be verified in exponential space by extending Rackoff's technique, sometimes in an unorthodox way. We obtain new optimal upper bounds, for example for place boundedness problem, reversal-boundedness detection (several variants are present in the paper), strong promptness detection problem and regularity detection. Our analysis is sufficiently refined so as to obtain a polynomial-space bound when the dimension is fixed.

show abstract

On Yen's Path Logic for Petri Nets

Cited by 31 publications

References 18 publications

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier

The Complexity of Diagnosability and Opacity Verification for Petri Nets

On Selective Unboundedness of VASS

Contact Info

Product

Resources

About