In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Equivalences for Fair Kripke Structures
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
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
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Applicability of fair simulation
Information and Computation
Applicability of fair simulation
Information and Computation
State space representation for verification of open systems
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
In this paper we compare among four notions of fair simulation: direct [6], delay [7], game [10], and exists [9]. 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.Based on our comparison we derive several practical implications: We develop an efficient approximated minimization algorithm for the direct/ delay simulations. In addition, we suggest a new implementation for the assume-guarantee modular framework presented in [9]. The new implementation, significantly improves the complexity of the framework.