Three partition refinement algorithms
SIAM Journal on Computing
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and boolean graphs
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
Science of Computer Programming
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Communication and Concurrency
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Checking for Language Inclusion Using Simulation Preorders
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Applicability of Fair Simulation
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Hierarchy of Polynomial-Time Computable Simulations for Automata
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
State Space Reductions for Alternating Büchi Automata
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An invariant-based approach to the verification of asynchronous parameterized networks
Journal of Symbolic Computation
On the virtue of patience: minimizing Büchi automata
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Concepts of automata construction from LTL
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Minimizing generalized büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Simulation relations for alternating parity automata and parity games
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Experiments with deterministic ω-automata for formulas of linear temporal logic
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Observations on determinization of büchi automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
LTL translation improvements in spot
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Security-by-contract: toward a semantics for digital signatures on mobile code
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
Concurrent small progress measures
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
We give efficient algorithms, beating or matching optimal known bounds, for computing a variety of simulation relations on the state space of a Büchi automaton. Our algorithms are derived via a unified and simple parity-game framework. This framework incorporates previously studied notions like fair and direct simulation, but our main motivation is state space reduction, and for this purpose we introduce a new natural notion of simulation, called delayed simulation. We show that, unlike fair simulation, delayed simulation preserves the automaton language upon quotienting, and that it allows substantially better state reduction than direct simulation.We use the parity-game approach, based on a recent algorithm by Jurdzinski, to efficiently compute all the above simulation relations. In particular, we obtain an O(mn3)-time and O(mn)-space algorithm for computing both the delayed and fair simulation relations. The best prior algorithm for fair simulation requires time O(n6) ([HKR97]). Our framework also allows one to compute bisimulations efficiently: we compute the fair bisimulation relation in O(mn3) time and O(mn) space, whereas the best prior algorithm for fair bisimulation requires time O(n10) ([HR00]).