Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes

DOI10.2168/LMCS-10(1:16)2014zbMath1325.68159OpenAlexW2092604016WikidataQ124439058 ScholiaQ124439058MaRDI QIDQ5404482

Rocco De Nicola, Michele Loreti, Marco Bernardo

Publication date: 24 March 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-10(1:16)2014

zbMATH Keywords

probabilistic modelslabeled transition systemsbehavioral equivalences

Mathematics Subject Classification ID

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 (10)

Trace Equivalence and Epistemic Logic to Express Security Properties ⋮ Determining asynchronous test equivalence for probabilistic processes ⋮ \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Unnamed Item ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Unnamed Item ⋮ A probabilistic calculus of cyber-physical systems

This page was built for publication: Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes