Pages that link to "Item:Q1898113"
From MaRDI portal
The following pages link to Reactive, generative, and stratified models of probabilistic processes (Q1898113):
Displayed 46 items.
- 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)
- Probabilistic communicating processes (Q672230) (← links)
- A hierarchy of probabilistic system types (Q703518) (← 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)
- 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)
- 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)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q1960528) (← 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)
- Non-bisimulation-based Markovian behavioral equivalences (Q2373649) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Modular construction of complete coalgebraic logics (Q2464936) (← links)
- A modular approach to defining and characterising notions of simulation (Q2495641) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- A theory of stochastic systems. I: Stochastic automata (Q2575854) (← links)
- Quantitative information in the tuple space coordination model (Q2576948) (← links)
- On the verification of qualitative properties of probabilistic processes under fairness constraints. (Q2583540) (← links)
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC (Q3021957) (← links)
- From Gene Regulation to Stochastic Fusion (Q3543333) (← links)
- Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems (Q3613092) (← links)
- Weighted versus Probabilistic Logics (Q3637211) (← links)
- Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders (Q5428916) (← links)
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems (Q5458058) (← links)
- Non Expansive ε-Bisimulations (Q5505435) (← links)
- Corrigendum to ``A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time'' (Q5941736) (← links)
- Process algebra for performance evaluation (Q5958464) (← links)