Reconciling real and stochastic time: the need for probabilistic refinement

DOI10.1007/S00165-012-0230-YMaRDI QIDQ1941867zbMATH OpenOpenAlexFDO

Authors J. Markovski, Erik de Vink, P. R. D'Argenio, Jos C. M. Baeten

Publication date 22 March 2013

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-012-0230-y

zbMATH Keywords

conservative extensionsgenerally-distributed stochastic delaysrace conditiontimed and stochastic process algebras

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

• Extending Timed Process Algebra with Discrete Stochastic Time
• scientific article; zbMATH DE number 1696898
• A theory of stochastic systems. II: Process algebra
• Formal Methods for the Design of Real-Time Systems
• Embedding Real Time in Stochastic Process Algebras

Cites work

• A brief history of process algebra
• A Compositional Approach to Performance Modelling
• A testing scenario for probabilistic processes
• A theory of stochastic systems. I: Stochastic automata
• A theory of stochastic systems. II: Process algebra
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Embedding Real Time in Stochastic Process Algebras
• Extending Timed Process Algebra with Discrete Stochastic Time
• Formal Methods for the Design of Real-Time Systems
• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 176736 (Why is no real title available?)
• scientific article; zbMATH DE number 2087806 (Why is no real title available?)
• scientific article; zbMATH DE number 1863173 (Why is no real title available?)
• scientific article; zbMATH DE number 2090712 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• scientific article; zbMATH DE number 3361677 (Why is no real title available?)
• Interactive Markov chains. And the quest for quantified quality
• On the consistency of Koomen's fair abstraction rule
• Performance evaluation of distributed systems based on a discrete real- and stochastic-time process algebra
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Refinement-oriented probability for CSP
• Retaining the probabilities in probabilistic testing theory

Cited in

(3)

• Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
• Discovering ePassport vulnerabilities using bisimilarity
• Expected-delay-summing weak bisimilarity for Markov automata

Describes a project that uses

Uses Software

• PRISM
• MoDeST

This page was built for publication: Reconciling real and stochastic time: the need for probabilistic refinement

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