scientific article
From MaRDI portal
Publication:3384913
Publication date: 17 December 2021
Full work available at URL: https://arxiv.org/abs/1808.08649
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Back to the format: a survey on SOS for probabilistic processes ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Unnamed Item ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metrics for labelled Markov processes
- Probabilistic logical characterization
- A logic for reasoning about time and reliability
- Testing equivalences for processes
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- The quantitative linear-time-branching-time spectrum
- Converging from Branching to Linear Metrics on Markov Chains
- Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
- A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
- Characterising Testing Preorders for Finite Probabilistic Processes
- A Theory of Communicating Sequential Processes
- Formal verification of parallel programs
- Linear Distances between Markov Chains
- Modal Decomposition on Nondeterministic Probabilistic Processes
- Formal verification of timed properties of randomized distributed algorithms
- Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
This page was built for publication:
