SAT-Solving the Coverability Problem for Petri Nets

Abdulla, Parosh Aziz; Iyer, S. Purushothaman; Nylén, Aletta

doi:10.1023/b:form.0000004786.30007.f8

Cited by 12 publications

(12 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently it was shown that SAT can be used, in combination with unfolding [12], for coverability checking of unbounded Petri nets [1]. Our approach can not be directly applied to unbounded Petri nets; but we think that extending the proposed method to infinite state systems is a challenging but important issue.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Discussionmentioning

confidence: 99%

“…As stated before, all reachable state can be explored by our method even with k = 1 if transitions are considered in the order t 1 , t 2 , · · · , t 7 . Now suppose that the order were the opposite, that is, t 7 , t 6 , · · · , t 1 . In this case the number of states that can be checked would be considerably reduced.…”

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

show abstract

“…Similar techniques have been used for analyzing Petri nets [3] and process graphs [19]. However, the constraints we derive are specifically aimed at checking that a configuration step preserves the structural properties of workflow nets.…”

Section: Related Workmentioning

confidence: 99%

Correctness-Preserving Configuration of Business Process Models

Aalst

Dumas

Gottschalk

et al. 2008

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. Reference process models capture recurrent business operations in a given domain such as procurement or logistics. These models are intended to be configured to fit the requirements of specific organizations or projects, leading to individualized process models that are subsequently used for domain analysis or solution design. Although the advantages of reusing reference process models compared to designing process models from scratch are widely accepted, the methods employed to configure reference process models are manual and error-prone. In particular, analysts are left with the burden of ensuring the correctness of the individualized process models and to manually fix errors. This paper proposes a foundation for configuring reference process models incrementally and in a way that ensures the correctness of the individualized process models, both with respect to syntax and behavioral semantics. Specifically, assuming the reference process model is behaviorally sound, the individualized process models are guaranteed to be sound.

show abstract

“…Recent research suggests that SAT-based algorithms can solve many combinatorial problems efficiently: applications include oriented matroids [18], the coverability problem for unbounded Petri nets [1], bounds on van der Waerden numbers [12,6], and many more. Solving a propositional formula that encodes a desired combinatorial object with a state-of-the-art SAT solver can be more efficient than the alternatives.…”

Section: Introductionmentioning

confidence: 99%

Finding Lean Induced Cycles in Binary Hypercubes

Chebiryak

Wahl

Kroening

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are, however, unable to perform a complete search. In this paper, we propose an approach to finding a special class of induced cycles we call lean, based on an efficient propositional SAT encoding. Lean induced cycles dominate a minimum number of hypercube nodes. Such cycles have been identified in Systems Biology as candidates for stable trajectories of gene regulatory networks. The encoding enabled us to compute lean induced cycles for hypercubes up to dimension 7. We also classify the induced cycles by the number of nodes they fail to dominate, using a custom-built All-SAT solver. We demonstrate how clause filtering can reduce the number of blocking clauses by two orders of magnitude.

show abstract

SAT-Solving the Coverability Problem for Petri Nets

Cited by 12 publications

References 25 publications

SAT-Based Verification of Safe Petri Nets

SAT-Based Verification of Safe Petri Nets

Correctness-Preserving Configuration of Business Process Models

Finding Lean Induced Cycles in Binary Hypercubes

Contact Info

Product

Resources

About