Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Theoretical Computer Science
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Verifying Abstractions of Timed Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The State Explosion Problem from Trace to Bisimulation Equivalence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Deciding Properties of Regular Real Time Processes
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Time-Abstracting Bisimulation for Probabilistic Timed Automata
TASE '08 Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
| Hi-index | 0.00 |
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the context of the analysis of system models, with applications in the stepwise development of systems and in model reduction. In this paper, we study probabilistic timed simulation and bisimulation relations for probabilistic timed automata. We present an EXPTIME algorithm for deciding whether two probabilistic timed automata are probabilistically timed similar or bisimilar. Furthermore, we consider a logical characterization of probabilistic timed bisimulation.