From Many Places to Few: Automatic Abstraction Refinement for Petri Nets

Authors:
Pierre Ganty;Jean-François Raskin;Laurent Van Begin
Affiliations:
(Correspd.) Département d'Informatique Université Libre de Bruxelles (U.L.B.), Belgium. pganty,jraskin,lvbegin@ulb.ac.be;Département d'Informatique Université Libre de Bruxelles (U.L.B.), Belgium. pganty,jraskin,lvbegin@ulb.ac.be;Département d'Informatique Université Libre de Bruxelles (U.L.B.), Belgium. pganty,jraskin,lvbegin@ulb.ac.be
Venue:
Fundamenta Informaticae - PETRI NETS 2007
Year:
2008

Citing 18
Cited 0

Reasoning about systems with many processes

Journal of the ACM (JACM)
Well-structured transition systems everywhere!

Theoretical Computer Science
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Partial Completeness of Abstract Fixpoint Checking

SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Unfoldings of Unbounded Petri Nets

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Attacking Symbolic State Explosion

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The Minimal Coverability Graph for Petri Nets

Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
The PEP Tool

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Storage Alternatives for Large Structured State Spaces

Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
General decidability theorems for infinite-state systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Binomial coefficient computation: recursion or iteration?

ACM SIGCSE Bulletin
Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM (JACM)
Parallel program schemata

Journal of Computer and System Sciences
From many places to few: automatic abstraction refinement for Petri nets

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
On the efficient computation of the minimal coverability set for Petri nets

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Syntactical colored petri nets reductions

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A complete abstract interpretation framework for coverability properties of WSTS

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Expand, enlarge, and check: new algorithms for the coverability problem of WSTS

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current algorithms for the automatic verification of Petri nets suffer from the explosion caused by the high dimensionality of the state spaces of practical examples. In this paper, we develop an abstract interpretation based analysis that reduces the dimensionality of state spaces that are explored during verification. In our approach, the dimensionality is reduced by trying to gather places that may not be important for the property to establish. If the abstraction that is obtained is too coarse, an automatic refinement is performed and a more precise abstraction is obtained. The refinement is computed by taking into account information about the inconclusive analysis. The process is iterated until the property is proved to be true or false.