Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Verifying Networks of Timed Processes (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficient Timed Reachability Analysis Using Clock Difference Diagrams
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Automatic Verification of Parameterized Cache Coherence Protocols
CAV '00 Proceedings of the 12th 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
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
An Effective Bottom-Up Semantics for First-Order Linear Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Beyond Parameterized Verification
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Attacking Symbolic State Explosion
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Algorithmic Verification of Invalidation-Based Protocols
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Constraint-Based Verification of Parameterized Cache Coherence Protocols
Formal Methods in System Design
Constraint-based automatic verification of abstract models of multithreaded programs
Theory and Practice of Logic Programming
Optimal reachability for multi-priced timed automata
Theoretical Computer Science
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Zone-based universality analysis for single-clock timed automata
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Optimal conditional reachability for multi-priced timed automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Forward analysis for petri nets with name creation
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Controller synthesis for MTL specifications
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Accelerations for the Coverability Set of Petri Nets with Names
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
The theory of WSTS: the case of complete WSTS
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Decidability results for well-structured transition systems with auxiliary storage
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
Many existing algorithms for model checking of infinite-state systems operate on constraints, which are used to represent (potentially infinite) sets of states. A general powerful technique, which can be employed for proving termination of these algorithms, is that of well quasi-orderings. Several methodologies have been proposed for derivation of new well quasi-ordered constraint systems. However, many of these constraint systems suffer from a 驴constraint explosion problem驴, as the number of the generated constraints grows exponentially with the size of the problem. In this paper, we demonstrate that a refinement of the theory of well quasi-orderings, called the theory of better quasi-orderings is more appropriate for symbolic model checking, since it allows inventing constraint systems, which are both well quasi-ordered and compact. We apply our methodology to derive new constraint systems for verification of systems with unboundedly many clocks, broadcast protocols, lossy channel systems, and integral relational automata. The new constraint systems are exponentially more succinct than existing ones, and their well quasi-ordering cannot be shown by previous methods in the literature.