Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes

DOI10.1007/978-3-642-28729-9_13zbMath1326.68197arXiv1402.5365OpenAlexW1878576160MaRDI QIDQ2892771

Michele Loreti, Marco Bernardo, Rocco De Nicola

Publication date: 22 June 2012

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.5365

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

A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Smooth coalgebra: testing vector analysis ⋮ Unnamed Item ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Relating strong behavioral equivalences for processes with nondeterminism and probabilities ⋮ Unnamed Item

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