Weak bisimulation for probabilistic timed automata
type: Item
instance of: scholarly article
title: Weak bisimulation for probabilistic timed automata
zbMATH Open document ID: 1208.68160
author: Ruggero Lanotte
author: Andrea Maggiolo-Schettini
author: Angelo Troina
published in: Theoretical Computer Science
publication date: 2010-11-19T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5817534
zbMATH Keywords: probabilistic timed automata
zbMATH Keywords: weak bisimulation
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.09.003
OpenAlex ID: W1968437296
cites work: A theory of timed automata
cites work: Automatic synthesis of real time systems
cites work: Q4251920
cites work: Q3241581
cites work: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
cites work: On probabilistic timed automata.
cites work: Forward analysis of updatable timed automata
cites work: Q4535035
cites work: Q4484499
cites work: Bisimulation for Demonic Schedulers
cites work: Probable innocence revisited
cites work: Making Random Choices Invisible to the Scheduler
cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability
cites work: Metrics for labelled Markov processes
cites work: Q5726943
cites work: Symbolic model checking for real-time systems
cites work: Q3266141
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
cites work: Automatic verification of real-time systems with discrete probability distributions.
cites work: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
cites work: A Decidable Probability Logic for Timed Probabilistic Systems
cites work: Reachability results for timed automata with unbounded data structures
cites work: Design and verification of long-running transactions in a timed framework
cites work: Bisimulation through probabilistic testing
cites work: Time-abstracted bisimulation: Implicit specifications and decidability
cites work: Forward and backward simulations. II: Timing-based systems
cites work: Q3992568
cites work: From ATP to timed graphs and hybrid systems
cites work: Three Partition Refinement Algorithms
cites work: Q4536612
cites work: Validation of Stochastic Systems
cites work: Simulation and Bisimulation for Probabilistic Timed Automata
DOI: 10.1016/J.TCS.2010.09.003
Recommended article: Simulation and Bisimulation for Probabilistic Timed Automata
Recommended article: Q4536612
Recommended article: Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
Recommended article: Deciding probabilistic automata weak bisimulation: theory and practice
Recommended article: Probabilistic weak bisimulation and axiomatization for probabilistic models
Recommended article: Probabilistic and Topological Semantics for Timed Automata
Recommended article: Bisimulations Meet PCTL Equivalences for Probabilistic Automata
Recommended article: Minimal Witnesses for Probabilistic Timed Automata
Recommended article: Model checking for probabilistic timed automata
description: scientific article; zbMATH DE number 5817534