Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Approximate testing equivalence based on time, probability, and observed behavior
- A survey of Markovian behavioral equivalences
- scientific article; zbMATH DE number 1759619
- Non-bisimulation-based Markovian behavioral equivalences
- Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 149518 (Why is no real title available?)
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- A behavioural pseudometric for probabilistic transition systems
- A process algebraic approach to software architecture design
- Approximate testing equivalence based on time, probability, and observed behavior
- Compatibility and inheritance in software architectures
- Equivalence and preorder checking for finite-state systems
- Metrics for labelled Markov processes
- Rate-Based Transition Systems for Stochastic Process Calculi
- Structural Operational Semantics for Stochastic Process Calculi
Cited in
(6)- Back to the format: a survey on SOS for probabilistic processes
- scientific article; zbMATH DE number 1759619 (Why is no real title available?)
- Testing probabilistic equivalence through reinforcement learning
- Modal logic characterization of Markovian testing and trace equivalences
- A survey of Markovian behavioral equivalences
- Approximate testing equivalence based on time, probability, and observed behavior
This page was built for publication: Approximating Markovian testing equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764291)
