Computing bisimilarity metrics for probabilistic timed automata

DOI10.1007/978-3-030-34968-4_17MaRDI QIDQ6536354zbMATH OpenFDO

Authors Ruggero Lanotte, Simone Tini

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-34968-4_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Simulation and Bisimulation for Probabilistic Timed Automata
• On metrics for probabilistic systems: definitions and algorithms
• The complexity of computing a bisimilarity pseudometric on probabilistic automata
• Weak bisimulation for probabilistic timed automata
• Deciding probabilistic bisimilarity distance one for probabilistic automata

Cites work

• A behavioural pseudometric for probabilistic transition systems
• A theory of timed automata
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• Approximating and computing behavioural distances in probabilistic transition systems
• Automatic verification of real-time systems with discrete probability distributions.
• Bisimulation through probabilistic testing
• Computer Aided Verification
• Computing probabilistic bisimilarity distances for probabilistic automata
• Computing probabilistic bisimilarity distances via policy iteration
• Computing the Skorokhod distance between polygonal traces
• Converging from branching to linear metrics on Markov chains
• Distance on timed words and applications
• Edit distance for timed automata
• Formal Modeling and Analysis of Timed Systems
• Forward analysis of updatable timed automata
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• Metrics for labelled Markov processes
• Model checking for probabilistic timed automata
• On behavioural pseudometrics and closure ordinals
• On probabilistic timed automata.
• On the complexity of computing probabilistic bisimilarity
• On-the-fly computation of bisimilarity distances
• On-the-fly exact computation of bisimilarity distances
• Quantitative Temporal Simulation and Refinement Distances for Timed Systems
• Simulation and Bisimulation for Probabilistic Timed Automata
• Symbolic model checking for real-time systems
• The complexity of computing a bisimilarity pseudometric on probabilistic automata
• Updatable timed automata
• Verifying abstractions of timed systems
• Weak bisimulation for probabilistic timed automata

Cited in

(1)

• Relative approximate bisimulations for fuzzy picture automata

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)