Pages that link to "Item:Q1898113"
From MaRDI portal
The following pages link to Reactive, generative, and stratified models of probabilistic processes (Q1898113):
Displaying 50 items.
- Performance analysis of concurrent systems in algebra dtsiPBC (Q300304) (← links)
- Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- The infinite evolution mechanism of \(\epsilon\)-bisimilarity (Q458130) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets (Q557805) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Metrics for labelled Markov processes (Q596029) (← links)
- Finite axiomatization for symbolic probabilistic \(\pi \)-calculus (Q615236) (← links)
- Probabilistic communicating processes (Q672230) (← links)
- A hierarchy of probabilistic system types (Q703518) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes (Q974113) (← links)
- Tempus fugit: How to plug it (Q997994) (← links)
- Testing from a stochastic timed system with a fault model (Q1001893) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- Algebraic theory of probabilistic and nondeterministic processes. (Q1400156) (← links)
- Algebraic theory of probabilistic processes. (Q1400293) (← links)
- Universal coalgebra: A theory of systems (Q1583483) (← links)
- A process algebra for probabilistic and nondeterministic processes (Q1607111) (← links)
- Additive models of probabilistic processes (Q1607220) (← links)
- Quantitative analysis of software approximate correctness (Q1664851) (← links)
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics (Q1683708) (← links)
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems (Q1731513) (← links)
- A behavioural pseudometric for probabilistic transition systems (Q1770428) (← links)
- Priority as extremal probability (Q1816921) (← links)
- Performance measure sensitive congruences for Markovian process algebras (Q1853585) (← links)
- Discrete time generative-reactive probabilistic processes with different advancing speeds (Q1853593) (← links)
- Testing preorders for probabilistic processes. (Q1854314) (← links)
- Language-based performance prediction for distributed and mobile systems (Q1854534) (← links)
- Paracategories. II: Adjunctions, fibrations and examples from probabilistic automata theory (Q1884930) (← links)
- Using schedulers to test probabilistic distributed systems (Q1941881) (← links)
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus (Q1941882) (← links)
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings (Q1954232) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q1960528) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- How adaptive and reliable is your program? (Q2117013) (← links)
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes (Q2257984) (← links)
- Refinement-oriented probability for CSP (Q2365393) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Specification, testing and implementation relations for symbolic-probabilistic systems (Q2368993) (← links)
