Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
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)
What's decidable about hybrid automata?
Journal of Computer and System Sciences
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
ACM Transactions on Computational Logic (TOCL)
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd 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
State Equivalences for Rectangular Hybrid Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Faster Model Checking for the Modal Mu-Calculus
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
LTL Over integer periodicity constraints
Theoretical Computer Science
Symbolic model checking for probabilistic timed automata
Information and Computation
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Simulating midlet's security claims with automata modulo theory
Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Verification of qualitative Z constraints
Theoretical Computer Science
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
Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On identification of input/output extended automata with finite bisimilar quotients
ACC'09 Proceedings of the 2009 conference on American Control Conference
Symbolic execution techniques for refinement testing
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Probabilistic and topological semantics for timed automata
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
A classification of the expressive power of well-structured transition systems
Information and Computation
Model refinement using bisimulation quotients
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Multiply-recursive upper bounds with Higman's Lemma
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Discrete Event Dynamic Systems
McScM: a general framework for the verification of communicating machines
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Formal analysis of piecewise affine systems through formula-guided refinement
Automatica (Journal of IFAC)
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Hi-index | 0.01 |
We define five increasingly comprehensive classes of infinite-state systems, called STS1--STS5, whose state spaces have finitary structure. For four of these classes, we provide examples from hybrid systems.STS1 These are the systems with finite bisimilarity quotients. They can be analyzed symbolically by iteratively applying predecessor and Boolean operations on state sets, starting from a finite number of observable state sets. Any such iteration is guaranteed to terminate in that only a finite number of state sets can be generated. This enables model checking of the μ-calculus.STS2 These are the systems with finite similarity quotients. They can be analyzed symbolically by iterating the predecessor and positive Boolean operations. This enables model checking of the existential and universal fragments of the μ-calculus.STS3 These are the systems with finite trace-equivalence quotients. They can be analyzed symbolically by iterating the predecessor operation and a restricted form of positive Boolean operations (intersection is restricted to intersection with observables). This enables model checking of all ω-regular properties, including linear temporal logic.STS4 These are the systems with finite distance-equivalence quotients (two states are equivalent if for every distance d, the same observables can be reached in d transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new state sets are generated. This enables model checking of the existential conjunction-free and universal disjunction-free fragments of the μ-calculus.STS5 These are the systems with finite bounded-reachability quotients (two states are equivalent if for every distance d, the same observables can be reached in d or fewer transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new states are encountered (this is a weaker termination condition than above). This enables model checking of reachability properties.