Reconciling real and stochastic time: the need for probabilistic refinement
From MaRDI portal
Publication:1941867
DOI10.1007/s00165-012-0230-yzbMath1259.68147OpenAlexW2149178443MaRDI QIDQ1941867
E. P. de Vink, J. Markovski, Jos C. M. Baeten, Pedro R. D'Argenio
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
race conditionconservative extensionsgenerally-distributed stochastic delaystimed and stochastic process algebras
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interactive Markov chains. And the quest for quantified quality
- On the consistency of Koomen's fair abstraction rule
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- A brief history of process algebra
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Refinement-oriented probability for CSP
- A theory of stochastic systems. I: Stochastic automata
- A theory of stochastic systems. II: Process algebra
- Performance Evaluation of Distributed Systems Based on a Discrete Real- and Stochastic-Time Process Algebra
- A testing scenario for probabilistic processes
- Retaining the Probabilities in Probabilistic Testing Theory
- Embedding Real Time in Stochastic Process Algebras
- A Compositional Approach to Performance Modelling
- Formal Methods for the Design of Real-Time Systems
- Extending Timed Process Algebra with Discrete Stochastic Time
- Foundations of Software Science and Computational Structures
