Symbolic analysis of bounded Petri nets

Pastor, Enric; Cortadella, Jordi; Roig, O.

doi:10.1109/12.926158

Cited by 53 publications

(30 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In practice, chaining can significantly reduce the number of iterations of the BFS algorithm [15,16]. The method is specially effective if the appropriate firing order of the events is selected.…”

Section: Reachability Analysismentioning

confidence: 99%

See 1 more Smart Citation

Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems

Pastor¹,

Peña²

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Symbolic reachability analysis based on Binary Decision Diagrams (BDDs) is a technique that allows the implementation of efficient state space exploration algorithms. However, in practice it is well known that the BDD blowup problem limits the size of the systems that can be analyzed. Conversely, simulation is a low-cost state generation technique, although its effectiveness is limited due to its inherent sequentiality. We present a hybrid methodology that combines simulation and symbolic traversal in order to improve the state space exploration of large systems. The methodology concentrates on asynchronous concurrent systems, whose peculiarities are not fully exploited by other existing techniques for hybrid verification. Our approach exploits the information obtained from simulations to improve the knowledge of the state space, effectively guiding symbolic traversal. We demonstrate the applicability of this methodology in the verification of complex control-dominated asynchronous circuits.

show abstract

Section: Reachability Analysismentioning

confidence: 99%

“…These observations have suggested alternative traversal algorithms, named chaining [14,15]. Chaining applies the individual TRs of events in a predetermined order such that the number of new states generated at each step is maximized.…”

Section: Reachability Analysismentioning

confidence: 99%

Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems

Pastor¹,

Peña²

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Finally we should remark that a problem similar to this transition ordering arises in using transition chaining [14], a technique for speeding up BDD-based reachability analysis. The authors of [14] suggested that given a transition t, all transitions in…”

Section: Transition Orderingmentioning

confidence: 99%

SAT-Based Verification of Safe Petri Nets

Ogata

Tsuchiya

Kikuno

2004

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract.Bounded model checking has received recent attention as an efficient verification method. The basic idea behind this new method is to reduce the model checking problem to the propositional satisfiability decision problem or SAT. However, this method has rarely been applied to Petri nets, because the ordinary encoding would yield a large formula due to the concurrent and asynchronous nature of Petri nets. In this paper, we propose a new SAT-based verification method for safe Petri nets. This method can reduce verification time by representing the behavior by very succinct formulas. Through an experiment using a suite of Petri nets, we show the effectiveness of the proposed method.

show abstract

“…One solution is the symbolic state space traversal by the so-called image computation elaborated by Pastor, Cortadella and Roig [7]. The algorithm builds the state space starting from the given initial state firing simultaneously all the enabled transitions from the set of the reachable states.…”

mentioning

confidence: 99%