Computing bisimilarity metrics for probabilistic timed automata
From MaRDI portal
Publication:6536354
DOI10.1007/978-3-030-34968-4_17zbMATH Open1540.68122MaRDI QIDQ6536354
Publication date: 19 April 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On behavioural pseudometrics and closure ordinals
- Metrics for labelled Markov processes
- Weak bisimulation for probabilistic timed automata
- Bisimulation through probabilistic testing
- A theory of timed automata
- Symbolic model checking for real-time systems
- Automatic verification of real-time systems with discrete probability distributions.
- Distance on timed words and applications
- A behavioural pseudometric for probabilistic transition systems
- On probabilistic timed automata.
- Forward analysis of updatable timed automata
- Updatable timed automata
- Model checking for probabilistic timed automata
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- Approximating and computing behavioural distances in probabilistic transition systems
- On the Complexity of Computing Probabilistic Bisimilarity
- Quantitative Temporal Simulation and Refinement Distances for Timed Systems
- Edit distance for timed automata
- Computing the Skorokhod distance between polygonal traces
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- Simulation and Bisimulation for Probabilistic Timed Automata
- Converging from branching to linear metrics on Markov chains
- Computing Probabilistic Bisimilarity Distances via Policy Iteration
- Computer Aided Verification
- On-the-Fly Exact Computation of Bisimilarity Distances
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- Formal Modeling and Analysis of Timed Systems
- Verifying abstractions of timed systems
Related Items (1)
This page was built for publication: Computing bisimilarity metrics for probabilistic timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536354)
