Reconciling real and stochastic time: the need for probabilistic refinement
From MaRDI portal
Publication:1941867
Recommendations
Cites work
- 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?)
- A Compositional Approach to Performance Modelling
- A brief history of process algebra
- 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
- 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
(2)
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)