The following pages link to (Q4847023):
Displaying 50 items.
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Abstract probabilistic automata (Q386011) (← links)
- Safety verification for probabilistic hybrid systems (Q389835) (← links)
- Measurable stochastics for Brane calculus (Q418841) (← links)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- The infinite evolution mechanism of \(\epsilon\)-bisimilarity (Q458130) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Probabilistic rely-guarantee calculus (Q507375) (← links)
- Structural operational semantics for non-deterministic processes with quantitative aspects (Q507377) (← links)
- Quantitative model-checking of controlled discrete-time Markov processes (Q515573) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Information hiding in probabilistic concurrent systems (Q549174) (← links)
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Finite axiomatization for symbolic probabilistic \(\pi \)-calculus (Q615236) (← links)
- Logical characterizations of simulation and bisimulation for fuzzy transition systems (Q679804) (← links)
- A hierarchy of probabilistic system types (Q703518) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- State explosion in almost-sure probabilistic reachability (Q846015) (← links)
- Performance analysis of probabilistic timed automata using digital clocks (Q853731) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Probable innocence revisited (Q860902) (← links)
- Behavioural equivalences for coalgebras with unobservable moves (Q890618) (← links)
- Integrating stochastic reasoning into Event-B development (Q903513) (← links)
- Probabilistic anonymity via coalgebraic simulations (Q974115) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- Algebraic theory of probabilistic and nondeterministic processes. (Q1400156) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- A process algebra for probabilistic and nondeterministic processes (Q1607111) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems (Q1697986) (← links)
- Verification and control of partially observable probabilistic systems (Q1699230) (← links)
- Verification and control for probabilistic hybrid automata with finite bisimulations (Q1734511) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Layered reasoning for randomized distributed algorithms (Q1941864) (← links)
- Using schedulers to test probabilistic distributed systems (Q1941881) (← links)
- Exploring probabilistic bisimulations. I (Q1941884) (← links)
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings (Q1954232) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes (Q1989321) (← links)
- Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations (Q2061250) (← links)
