The metric linear-time branching-time spectrum on nondeterministic probabilistic processes

DOI10.1016/J.TCS.2019.09.019MaRDI QIDQ1989321zbMATH OpenOpenAlexFDO

Authors Valentina Castiglioni, Michele Loreti, Simone Tini

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

zbMATH Keywords

trace metricnondeterministic probabilistic processesbisimulation metrictesting metric

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The spectrum of strong behavioral equivalences for nondeterministic and probabilistic processes
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• Behavioural pseudometrics for nondeterministic probabilistic systems
• Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism

Cites work

• scientific article; zbMATH DE number 3115890 (Why is no real title available?)
• scientific article; zbMATH DE number 7447772 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 2038772 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
• A Theory of Communicating Sequential Processes
• A behavioural pseudometric for probabilistic transition systems
• An application of games to the completeness problem for formalized theories
• Bisimulation through probabilistic testing
• Characterising Testing Preorders for Finite Probabilistic Processes
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• Compositionality of approximate bisimulation for probabilistic systems
• Converging from Branching to Linear Metrics on Markov Chains
• Fixed-point characterization of compositionality properties of probabilistic processes combinators
• Formal verification of parallel programs
• Labelled Markov processes.
• Linear distances between Markov chains
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• Metrics for labelled Markov processes
• Modal decomposition on nondeterministic probabilistic processes
• On behavioural pseudometrics and closure ordinals
• Probabilistic logical characterization
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
• Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
• SOS specifications for uniformly continuous operators
• SOS-based modal decomposition on nondeterministic probabilistic processes
• Testing equivalences for processes
• The quantitative linear-time-branching-time spectrum
• The spectrum of strong behavioral equivalences for nondeterministic and probabilistic processes
• Weak bisimulation metrics in models with nondeterminism and continuous state spaces

Cited in

(10)

• A framework to measure the robustness of programs in the unpredictable environment
• Automata, Languages and Programming
• How adaptive and reliable is your program?
• Back to the format: a survey on SOS for probabilistic processes
• The spectrum of strong behavioral equivalences for nondeterministic and probabilistic processes
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• Determining asynchronous test equivalence for probabilistic processes
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

This page was built for publication: The metric linear-time branching-time spectrum on nondeterministic probabilistic processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1989321)