Weak bisimulation for probabilistic timed automata

DOI10.1016/j.tcs.2010.09.003zbMath1208.68160OpenAlexW1968437296MaRDI QIDQ606996

Angelo Troina, Andrea Maggiolo-Schettini, Ruggero Lanotte

Publication date: 19 November 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.003

zbMATH Keywords

probabilistic timed automataweak bisimulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Parametric probabilistic transition systems for system design and analysis ⋮ Finite axiomatization for symbolic probabilistic \(\pi \)-calculus ⋮ Probability timed automata for investigating communication processes ⋮ Compositional weak metrics for group key update

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Reachability results for timed automata with unbounded data structures
• Probable innocence revisited
• CCS expressions, finite state processes, and three problems of equivalence
• Design and verification of long-running transactions in a timed framework
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Bisimulation through probabilistic testing
• A theory of timed automata
• From ATP to timed graphs and hybrid systems
• Symbolic model checking for real-time systems
• Time-abstracted bisimulation: Implicit specifications and decidability
• Automatic verification of real-time systems with discrete probability distributions.
• On probabilistic timed automata.
• Forward analysis of updatable timed automata
• Forward and backward simulations. II: Timing-based systems
• A Decidable Probability Logic for Timed Probabilistic Systems
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Making Random Choices Invisible to the Scheduler
• Simulation and Bisimulation for Probabilistic Timed Automata
• Bisimulation for Demonic Schedulers
• Three Partition Refinement Algorithms
• Automatic synthesis of real time systems
• Validation of Stochastic Systems
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems