Revisiting trace and testing equivalences for nondeterministic and probabilistic processes

DOI10.2168/LMCS-10(1:16)2014MaRDI QIDQ5404482zbMATH OpenOpenAlexWikidataFDO

Authors Marco Bernardo, Rocco De Nicola, Michele Loreti

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

behavioral equivalenceslabeled transition systemsprobabilistic models

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)

Recommendations

• Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
• The spectrum of strong behavioral equivalences for nondeterministic and probabilistic processes
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• scientific article; zbMATH DE number 7311343
• Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism

Cited in

(18)

• On deciding trace equivalences for processes
• \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
• The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
• A probabilistic calculus of cyber-physical systems
• Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism
• Towards general axiomatizations for bisimilarity and trace semantics
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• Determining asynchronous test equivalence for probabilistic processes
• Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
• Trace and testing metrics on nondeterministic probabilistic processes
• The spectrum of strong behavioral equivalences for nondeterministic and probabilistic processes
• Trace equivalence and epistemic logic to express security properties
• The theory of traces for systems with nondeterminism, probability, and termination
• Nondeterministic fuzzy automata with membership values in complete residuated lattices
• Back to the format: a survey on SOS for probabilistic processes
• Convex language semantics for nondeterministic probabilistic automata
• Logical characterization of trace metrics
• A unifying approach to probabilistic testing equivalences

This page was built for publication: Revisiting trace and testing equivalences for nondeterministic and probabilistic processes

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