Reduction and covering of infinite reachability trees
Information and Computation
Decidability of a temporal logic problem for petri nets
IDTC Second international conference on Database theory
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding bisimulation equivalences for a class of non-finite-state programs
Information and Computation
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation: a semantics-based tool for program analysis
Handbook of logic in computer science (vol. 4)
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Feasibility of Finite and Infinite Paths in Data Dependent Programs
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
CCS + Time = An Interleaving Model for Real Time Systems
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Journal of Computer and System Sciences
Solving coverability problems of petri nets by partial deduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Model checking of systems with many identical timed processes
Theoretical Computer Science
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
An Algebraic Framework for Abstract Model Checking
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
On the Existence of Network Invariants for Verifying Parameterized Systems
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
An Effective Bottom-Up Semantics for First-Order Linear Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Transitive Closures of Regular Relations for Verifying Infinite-State Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Symbolic Representation of Upward-Closed Sets
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Parameterized Verification of Multithreaded Software Libraries
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Beyond Parameterized Verification
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards the Automated Verification of Multithreaded Java Programs
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Classification of Symbolic Transition Systems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Compositional Termination Analysis of Symbolic Forward Analysis
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Symbolic Computation of Maximal Probabilistic Reachability
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Channel Representations in Protocol Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Constraint-Based Model Checking for Parameterized Synchronous Systems
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Constraint-Based Verification of Client-Server Protocols
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
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
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
A Unifying Model Checking Approach for Safety Properties of Parameterized Systems
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 Analysis of Broadcast Protocols
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Languages, Rewriting Systems, and Verification of Infinite-State Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Some Decidability Results for Nested Petri Nets
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Better is Better than Well: On Efficient Verification of Infinite-State Systems
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
Constraint-Based Verification of Parameterized Cache Coherence Protocols
Formal Methods in System Design
An effective fixpoint semantics for linear logic programs
Theory and Practice of Logic Programming
Model checking linear logic specifications
Theory and Practice of Logic Programming
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Automatic generation of symbolic model for parameterized synchronous systems
Journal of Computer Science and Technology
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
On the ω-language expressive power of extended petri nets
Theoretical Computer Science - Expressiveness in concurrency
Interprocedural analysis of asynchronous programs
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint-based automatic verification of abstract models of multithreaded programs
Theory and Practice of Logic Programming
ACM Transactions on Computational Logic (TOCL)
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Towards SMT Model Checking of Array-Based Systems
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Biologically Inspired Model with Fusion and Clonation of Membranes
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Model Checking of Control-User Component-Based Parametrised Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Tree Pattern Rewriting Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Monotonic Abstraction in Parameterized Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
On the Qualitative Analysis of Conformon P Systems
Membrane Computing
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
ACM SIGARCH Computer Architecture News
Approximated Context-Sensitive Analysis for Parameterized Verification
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Automated deduction for verification
ACM Computing Surveys (CSUR)
Light-Weight SMT-based Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding branching time properties for asynchronous programs
Theoretical Computer Science
Automatic Verification of Directory-Based Consistency Protocols
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Goal-Directed Invariant Synthesis for Model Checking Modulo Theories
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A New Approach to Upward-Closed Set Backward Reachability Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Games for Counting Abstractions
Electronic Notes in Theoretical Computer Science (ENTCS)
On the verification problem for weak memory models
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A well-structured framework for analysing petri net extensions
Information and Computation
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Journal of Computer and System Sciences
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
A generic framework for reasoning about dynamic networks of infinite-state processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Regular model checking without transducers (on efficient verification of parameterized systems)
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Rapid parameterized model checking of snoopy cache coherence protocols
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
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
Is lazy abstraction a decision procedure for broadcast protocols?
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
From model-checking to temporal logic constraint solving
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A cut-off approach for bounded verification of parameterized systems
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Decidability properties for fragments of chr
Theory and Practice of Logic Programming
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Constrained monotonic abstraction: a CEGAR for parameterized verification
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Parameterized verification of ad hoc networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
DISC'10 Proceedings of the 24th international conference on Distributed computing
On the verification of membrane systems with dynamic structure
Natural Computing: an international journal
A classification of the expressive power of well-structured transition systems
Information and Computation
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Program specialization for verifying infinite state systems: an experimental evaluation
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Formalization and automated verification of RESTful behavior
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
The reachability problem for vector addition system with one zero-test
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Carrying probabilities to the infinite world
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Decidability of LTL for vector addition systems with one zero-test
RP'11 Proceedings of the 5th international conference on Reachability problems
Complexity analysis of the backward coverability algorithm for VASS
RP'11 Proceedings of the 5th international conference on Reachability problems
Automated termination in model checking modulo theories
RP'11 Proceedings of the 5th international conference on Reachability problems
A Decidability Result for the Model Checking of Infinite-State Systems
Journal of Automated Reasoning
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decision problems for the verification of real-time software
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Analysis of recursively parallel programs
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Empirically efficient verification for a class of infinite-state systems
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Achieving a general, formal and decidable approach to the OR-Join in workflow using reset nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
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... made efficient
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Analysis of communicating automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Forward analysis of depth-bounded processes
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
MCMT: a model checker modulo theories
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Ideal abstractions for well-structured transition systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Attacking the dimensionality problem of parameterized systems via bounded reachability graphs
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
What's decidable about weak memory models?
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Counter-Example guided fence insertion under TSO
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Solving coverability problem for monotonic counter systems by supercompilation
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Cubicle: a parallel SMT-based model checker for parameterized systems: tool paper
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Fixpoint-guided abstraction refinements
SAS'07 Proceedings of the 14th international conference on Static Analysis
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Comparing the expressive power of well-structured transition systems
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Efficient coverability analysis by proof minimization
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Decidability problems for actor systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Multi-core reachability for timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Well-structured graph transformation systems with negative application conditions
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Symbolic backward reachability with effectively propositional logic
Formal Methods in System Design
Structural counter abstraction
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Analysis of Recursively Parallel Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Component reconfiguration in the presence of conflicts
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Parameterized verification of asynchronous shared-memory systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Incremental, inductive coverability
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Solving parity games on integer vectors
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.01 |
Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems), which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a well-ordered and well-founded preorder such that the transition relation is "monotonic" (is a simulation) with respect to the preorder. We show that the following properties are decidable for well-structured systems: reachability; eventuality; and simulation. We also describe how these general principles subsume several decidability results from the literature about timed automata, relational automata, Petri nets, and lossy channel systems.