The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
type: Item
instance of: scholarly article
title: The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
zbMATH Open document ID: 1433.68242
author: Valentina Castiglioni
author: Michele Loreti
author: Simone Tini
published in: Theoretical Computer Science
publication date: 2020-04-21T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 7191308
zbMATH Keywords: trace metric
zbMATH Keywords: testing metric
zbMATH Keywords: bisimulation metric
zbMATH Keywords: nondeterministic probabilistic processes
MaRDI profile type: Publication
full work available at URL: j.tcs.2019.09.019
OpenAlex ID: W2973264323
cites work: Converging from Branching to Linear Metrics on Markov Chains
cites work: Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
cites work: Q4992526
cites work: Relating strong behavioral equivalences for processes with nondeterminism and probabilities
cites work: A Theory of Communicating Sequential Processes
cites work: Q3384913
cites work: Modal Decomposition on Nondeterministic Probabilistic Processes
cites work: Q4580323
cites work: Logical characterization of branching metrics for nondeterministic probabilistic transition systems
cites work: Linear Distances between Markov Chains
cites work: Q4449238
cites work: Testing equivalences for processes
cites work: Characterising Testing Preorders for Finite Probabilistic Processes
cites work: Metrics for labelled Markov processes
cites work: An application of games to the completeness problem for formalized theories
cites work: The quantitative linear-time-branching-time spectrum
cites work: Q3230355
cites work: Compositional bisimulation metric reasoning with Probabilistic Process Calculi
cites work: Q4992498
cites work: Q4995155
cites work: SOS specifications for uniformly continuous operators
cites work: Probabilistic may/must testing: retaining probabilities by restricted schedulers
cites work: Probabilistic logical characterization
cites work: Q3777424
cites work: Formal verification of parallel programs
cites work: Weak bisimulation metrics in models with nondeterminism and continuous state spaces
cites work: Bisimulation through probabilistic testing
cites work: Q3619416
cites work: Q4847023
cites work: On behavioural pseudometrics and closure ordinals
cites work: A behavioural pseudometric for probabilistic transition systems
cites work: A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
DOI: 10.1016/J.TCS.2019.09.019
description: scientific article; zbMATH DE number 7191308