Theoretical Computer Science
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Computing Behavioural Relations, Logically
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Efficient Verification of Timed Automata with BDD-Like Data-Structures
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Verifying Abstractions of Timed Systems
CONCUR '96 Proceedings of the 7th 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
Verification of an Audio Protocol with Bus Collision Using UPPAAL
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
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures
IEEE Transactions on Software Engineering
TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering
IEEE Transactions on Software Engineering
Symbolic verification of distributed real-time systems with complex synchronizations
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Symbolic consistency checking of OpenMp parallel programs
Proceedings of the 13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems
Efficient model-checking of dense-time systems with time-convexity analysis
Theoretical Computer Science
| Hi-index | 0.00 |
A model automaton is simulated by a specification automaton if every externally observable transition by the model can also be matched by the specification. In this work, we establish a new formulation of simulation from a model TA to a specification TA. The new formulation allows us to develop a simulation-checking algorithm, in greatest fixpoint style, with zones. We also present a technique to construct an under-approximation of the set of state-pairs to be removed in a fixpoint iteration. The technique does not sacrifice the exactness of our algorithm and could enhance the performance of simulation-checking. Finally, we report the performance of an implementation of our algorithms.