Complexity results for 1-safe nets

Cheng, Allan; Esparza, Javier; Palsberg, Jens

doi:10.1016/0304-3975(94)00231-7

Cited by 108 publications

(76 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For NP-hardness, we propose a reduction from the problem of reachability of a marking M in a 1-safe acyclic 1 Petri net N , known to be NP-complete [11,12]. The reduction is as follows: equip the 1-safe acyclic Petri net N with complementary places 2 : a place p for each p ∈ P , with p initially marked iff p is not, p ∈ • t iff p ∈ t • \ • t, and p ∈ t • iff p ∈ • t \ t • .…”

Section: Corollarymentioning

confidence: 99%

Anti-alignments in Conformance Checking – The Dark Side of Process Models

Chatain

Carmona

2016

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

Abstract. Conformance checking techniques asses the suitability of a process model in representing an underlying process, observed through a collection of real executions. These techniques suffer from the wellknown state space explosion problem, hence handling process models exhibiting large or even infinite state spaces remains a challenge. One important metric in conformance checking is to asses the precision of the model with respect to the observed executions, i.e., characterize the ability of the model to produce behavior unrelated to the one observed. By avoiding the computation of the full state space of a model, current techniques only provide estimations of the precision metric, which in some situations tend to be very optimistic, thus hiding real problems a process model may have. In this paper we present the notion of antialignment as a concept to help unveiling traces in the model that may deviate significantly from the observed behavior. Using anti-alignments, current estimations can be improved, e.g., in precision checking. We show how to express the problem of finding anti-alignments as the satisfiability of a Boolean formula, and provide a tool which can deal with large models efficiently.

show abstract

Section: Corollarymentioning

confidence: 99%

Anti-alignments in Conformance Checking – The Dark Side of Process Models

Chatain

Carmona

2016

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

show abstract

“…• The PSPACE-hardness is a consequence that reachability in untimed 1-safe Petri net is a PSPACE-complete problem [21].…”

Section: Theorem 3 (Pspace-completeness)mentioning

confidence: 99%

TCTL Model Checking of Time Petri Nets

Boucheneb¹,

Gardey

Roux³

2009

Journal of Logic and Computation

View full text Add to dashboard Cite

We consider Time Petri Nets (TPN) for which a firing time interval is associated with each transition. State space abstractions for TPN preserving various classes of properties (LTL, CTL, CTL * ) can be computed, in terms of so called state classes. Some methods were proposed to check quantitative timed properties but are not suitable for effective verification of properties of real-life systems.In this paper, we consider subscript TCTL for TPN (TPN-TCTL) for which temporal operators are extended with a time interval, specifying a time constraint on the firing sequences. We prove the decidability of TPN-TCTL on bounded TPN and give its theoretical complexity.We propose a zone based state space abstraction that preserves marking reachability and traces of the TPN. As for Timed Automata (TA), the abstraction may use an over-approximation operator on zones to enforce the termination. A coarser (and efficient) abstraction is then provided and proved exact w.r.t. marking reachability and traces (LTL properties).Finally, we consider a subset of TPN-TCTL properties (TPN-TCTL S ) for which it is possible to propose efficient on-the-fly model-checking algorithms. Our approach consists in computing and exploring the zone based state space abstraction. On a practical point of view, the method is integrated in ROMEO [24], a tool for Time Petri Nets edition and analysis. In addition to the old features it is now possible to effectively verify a subset of TCTL directly on Time Petri Nets. Index TermsTime Petri Net, Model-checking, TCTL, zone based state space abstraction.

show abstract

“…Properties of systems have been classified into safety-and liveness-properties in [23] and have been investigated in various settings, see for example [24,25]. In Sect.…”

Section: Properties Of Interaction Systemsmentioning

confidence: 99%

Robustness in Interaction Systems

Majster-Cederbaum

Martens

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.We treat the effect of absence/failure of ports or components on properties of component-based systems. We do so in the framework of interaction systems, a formalism for component-based systems that strictly separates the issues of local behavior and interaction, for which ideas to establish properties of systems were developed. We propose how to adapt these ideas to analyze how the properties behave under absence or failure of certain components or merely some ports of components. We demonstrate our approach for the properties local and global deadlockfreedom as well as liveness and local progress.

show abstract

Complexity results for 1-safe nets

Cited by 108 publications

References 11 publications

Anti-alignments in Conformance Checking – The Dark Side of Process Models

Anti-alignments in Conformance Checking – The Dark Side of Process Models

TCTL Model Checking of Time Petri Nets

Robustness in Interaction Systems

Contact Info

Product

Resources

About