Discrete time generative-reactive probabilistic processes with different advancing speeds
From MaRDI portal
Publication:1853593
DOI10.1016/S0304-3975(01)00344-9zbMath1018.68051MaRDI QIDQ1853593
Mario Bravetti, Alessandro Aldini
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (11)
Specification, testing and implementation relations for symbolic-probabilistic systems ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Unnamed Item ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Using schedulers to test probabilistic distributed systems ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders ⋮ A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets ⋮ A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems ⋮ Non Expansive ε-Bisimulations ⋮ Notes on Generative Probabilistic Bisimulation
Cites Work
- Transition system specifications with negative premises
- Bisimulation through probabilistic testing
- Formal performance modelling and evaluation of an adaptive mechanism for packetised audio over the internet
- Processes with probabilities, priority and time
- Composition and behaviors of probabilistic I/O automata
- A process algebra for timed systems
- Reactive, generative, and stratified models of probabilistic processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Process Algebra
- On “Axiomatising Finite Concurrent Processes”
- ``Closed interval process algebra versus ``interval process algebra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Discrete time generative-reactive probabilistic processes with different advancing speeds
