Algebraic theory of probabilistic processes.
From MaRDI portal
Publication:1400293
DOI10.1016/S1567-8326(02)00069-3zbMath1048.68057MaRDI QIDQ1400293
Publication date: 13 August 2003
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets, Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language, Testing from a stochastic timed system with a fault model, Specification, testing and implementation relations for symbolic-probabilistic systems, Non-bisimulation-based Markovian behavioral equivalences, \(\pi\)-calculus with noisy channels, Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems
Cites Work
- Probabilistic and prioritized models of timed CSP
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Testing equivalences for processes
- Composition and behaviors of probabilistic I/O automata
- A process algebra for probabilistic and nondeterministic processes
- Testing preorders for probabilistic processes.
- Reactive, generative, and stratified models of probabilistic processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Acceptance trees
- Testing probabilistic automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item