Theory of linear and integer programming
Theory of linear and integer programming
Transformations and decompositions of nets
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
APN 90 Proceedings on Advances in Petri nets 1990
A practical algorithm for exact array dependence analysis
Communications of the ACM
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Transitive closure of infinite graphs and its applications
Transitive closure of infinite graphs and its applications
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Comparison of Presburger Engines for EFSM Reachability
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Delay Analysis in Synchronous Programs
CAV '93 Proceedings of the 5th 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
Real-Time System Verification using P/T Nets
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Symbolic Verification with Periodic Sets
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On Combining the Persistent Sets Method with the Covering Steps Graph Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Compositional Termination Analysis of Symbolic Forward Analysis
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Accurate Widenings and Boundedness Properties of Timed Systems
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Constraint-Based Model Checking for Parameterized Synchronous Systems
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
CL '00 Proceedings of the First International Conference on Computational Logic
Attacking Symbolic State Explosion
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Constraint-Based Analysis of Broadcast Protocols
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Service Oriented Computing and Applications
Derivation of non-structural invariants of petri nets using abstract interpretation
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
MCMT: a model checker modulo theories
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Using real relaxations during program specialization
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Improving Reachability Analysis of Infinite State Systems by Specialization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.01 |
In this paper, we address the issue of reachability analysis for Petri nets, viewed as automata with counters. We show that exact reachability analysis can be achieved by treating Petri nets integer variables (counters) as real-valued variables, and using Fourier-Motzkin procedure instead of Presburger elimination procedure. As a consequence, one can safely analyse Petri nets with performant tools, e.g. HyTech, originally designed for analysing automata with real-valued variables (clocks). We also investigate the use of meta-transitions (iterative application of a transition in a single step) and give sufficient conditions ensuring an exact computation in this case. Experimental results with HyTech show an impressive speed-up with respect to previous experiences performed with a Presburger arithmetic solver. The method extends for analysing Petri nets with inhibitors and with timing constraints, but difficulties arise for the treatment of meta-transitions in the latter case.