Three partition refinement algorithms
SIAM Journal on Computing
An efficiency preorder for processes
Acta Informatica
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
An Efficient Algorithm for Minimizing Real-Time Transition Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Communication and Concurrency
Performance Preorder: Ordering Processes with Respect to Speed
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
A Formalism for Remotely Interacting Processes
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Model Checking of Real-Time Reachability Properties Using Abstractions
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficient Scaling-Invariant Checking of Timed Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Time Abstracted Bisimiulation: Implicit Specifications and Decidability
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Forward Analysis of Updatable Timed Automata
Formal Methods in System Design
Lower and upper bounds in zone-based abstractions of timed automata
International Journal on Software Tools for Technology Transfer (STTT)
Reactive Systems: Modelling, Specification and Verification
Reactive Systems: Modelling, Specification and Verification
Static guard analysis in timed automata verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
The earlier the better: a theory of timed actor interfaces
Proceedings of the 14th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
In this paper, we propose an at least as fast as relation between two timed automata states and investigate its decidability. The proposed relation is a prebisimulation and we show that given two processes with rational clock valuations it is decidable whether such a prebisimulation relation exists between them. Though bisimulation relations have been widely studied with respect to timed systems and timed automata, prebisimulations in timed systems form a much lesser studied area and according to our knowledge, this is the first of the kind where we study the decidability of a timed prebisimulation. This prebisimulation has been termed timed performance prebisimulation since it compares the efficiency of two states in terms of their performances in performing actions. if s and t are time abstracted bisimilar and every possible delay by s and its successors is no more than the delays performed by t and its successors where the delays are real numbers. The prebisimilarity defined here falls in between timed and time abstracted bisimilarity.