Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Properties of Conflict-Free and Persistent Petri Nets
Journal of the ACM (JACM)
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
The Power of QDDs (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
TReX: A Tool for Reachability Analysis of Complex Systems
CAV '01 Proceedings of the 13th 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
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On iterating linear transformations over recognizable sets of integers
Theoretical Computer Science
From Automata to Formulas: Convex Integer Polyhedra
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
Computing Convex Hulls by Automata Iteration
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Model checking succinct and parametric one-counter automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
The complexity of reversal-bounded model-checking
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Branching-Time model checking of parametric one-counter automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Taming past LTL and flat counter systems
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A Perfect Model for Bounded Verification
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Using real relaxations during program specialization
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Accelerated data-flow analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
On the complexity of verifying regular properties on flat counter systems,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Presburger Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be “replaced”, equivalently w.r.t. reachability, by another one with no nested loops. From a practical view point, we show that flatness is a necessary and sufficient condition for termination of accelerated symbolic model checking, a generic semi-algorithmic technique implemented in successful tools like Fast, Lash or TReX. From a theoretical view point, we prove that many known semilinear subclasses of counter automata are flat: reversal bounded counter machines, lossy vector addition systems with states, reversible Petri nets, persistent and conflict-free Petri nets, etc. Hence, for these subclasses, the semilinear reachability set can be computed using a uniform accelerated symbolic procedure (whereas previous algorithms were specifically designed for each subclass).