Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Defining conditional independence using collapses
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
Model checking
An automata-theoretic approach to modular model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Equivalences for Fair Kripke Structures
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Applicability of Fair Simulation
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
CONCUR '97 Proceedings of the 8th 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
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Checking for Language Inclusion Using Simulation Preorders
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Verification of Fair Transisiton Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Enhancing simulation for checking language containment
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Verification of initial-state opacity in security applications of discrete event systems
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper we compare four notions of fair simulation: direct [9], delay [12], game [19], and exists [16]. Our comparison refers to three main aspects: The time complexity of constructing the fair simulation, the ability to use it for minimization, and the relationship between the fair simulations and universal branching-time logics. We developed a practical application that is based on this comparison. The application is a new implementation for the assume-guarantee modular framework presented By Grumberg at al. in [ACM Transactions on Programming Languages and Systems (TOPLAS), 16 (1994) 843]. The new implementation significantly improves the complexity of the framework.