The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
From MaRDI portal
Publication:1989321
DOI10.1016/j.tcs.2019.09.019zbMath1433.68242OpenAlexW2973264323MaRDI QIDQ1989321
Valentina Castiglioni, Simone Tini, Michele Loreti
Publication date: 21 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.019
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Determining asynchronous test equivalence for probabilistic processes ⋮ A framework to measure the robustness of programs in the unpredictable environment ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ How adaptive and reliable is your program?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On behavioural pseudometrics and closure ordinals
- Metrics for labelled Markov processes
- Probabilistic logical characterization
- Bisimulation through probabilistic testing
- Testing equivalences for processes
- Weak bisimulation metrics in models with nondeterminism and continuous state spaces
- SOS specifications for uniformly continuous operators
- A behavioural pseudometric for probabilistic transition systems
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- 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
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- An application of games to the completeness problem for formalized theories
- 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
- Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
This page was built for publication: The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
