Simulation and Bisimulation for Probabilistic Timed Automata
From MaRDI portal
Recommendations
- Weak bisimulation for probabilistic timed automata
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Model checking for probabilistic timed automata
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- Probabilistic and Topological Semantics for Timed Automata
- Symbolic model checking for probabilistic timed automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Cited in
(14)- Probabilistic logical characterization
- Simulation for lattice-valued doubly labeled transition systems
- On probabilistic alternating simulations
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- Unwinding biological systems
- Bisimulations meet PCTL equivalences for probabilistic automata
- Weak bisimulation for probabilistic timed automata
- Probabilistic simulation for probabilistic data-aware business processes
- Trace-Based Semantics for Probabilistic Timed I/O Automata
- scientific article; zbMATH DE number 5997233 (Why is no real title available?)
- Bisimulations meet PCTL equivalences for probabilistic automata
- Efficient scaling-invariant checking of timed bisimulation
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- Computing bisimilarity metrics for probabilistic timed automata
This page was built for publication: Simulation and Bisimulation for Probabilistic Timed Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588096)