Trace machines for observing continuous-time Markov chains

DOI10.1016/J.ENTCS.2005.10.042MaRDI QIDQ7014284zbMATH OpenFDO

Authors Verena Wolf, Christel Baier, Mila Majster-Cederbaum

Publication date 11 March 2025

Full work available at URL https://doi.org/10.1016/J.ENTCS.2005.10.042

zbMATH Keywords

button-pushing experimentlinear-time semanticsMarkov chaintrace equivalencetrace machine

Mathematics Subject Classification ID

Applications of continuous-time Markov processes on discrete state spaces (60J28) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• Bisimulation through probabilistic testing
• CONCUR 2003 - Concurrency Theory
• Coordination Models and Languages
• Extended Markovian Process Algebra
• scientific article; zbMATH DE number 149518 (Why is no real title available?)
• scientific article; zbMATH DE number 1512615 (Why is no real title available?)
• scientific article; zbMATH DE number 1538048 (Why is no real title available?)
• scientific article; zbMATH DE number 1759619 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 846904 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Interactive Markov chains. And the quest for quantified quality
• Testing preorders for probabilistic processes
• Testing probabilistic automata

Cited in

(2)

• Trace semantics for stochastic systems with nondeterminism
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: Trace machines for observing continuous-time Markov chains

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