Pages that link to "Item:Q1175940"
From MaRDI portal
The following pages link to Bisimulation through probabilistic testing (Q1175940):
Displaying 50 items.
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- General patterns of interaction in stochastic fusion (Q272780) (← links)
- Belief and truth in hypothesised behaviours (Q274416) (← links)
- A metrized duality theorem for Markov processes (Q283765) (← links)
- Identifying all preorders on the subdistribution monad (Q283773) (← links)
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions (Q288785) (← links)
- A pseudometric in supervisory control of probabilistic discrete event systems (Q351739) (← links)
- Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
- Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- Structural operational semantics for stochastic and weighted transition systems (Q383372) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- A coalgebraic perspective on linear weighted automata (Q418134) (← links)
- Measurable stochastics for Brane calculus (Q418841) (← links)
- Lumpability abstractions of rule-based systems (Q418843) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- On behavioural pseudometrics and closure ordinals (Q456100) (← links)
- The infinite evolution mechanism of \(\epsilon\)-bisimilarity (Q458130) (← links)
- Lattice-valued simulations for quantitative transition systems (Q473367) (← links)
- Structural operational semantics for non-deterministic processes with quantitative aspects (Q507377) (← links)
- Differential privacy in probabilistic systems (Q529047) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- A logical duality for underspecified probabilistic systems (Q532396) (← links)
- Unprovability of the logical characterization of bisimulation (Q549668) (← 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)
- Weakening the perfect encryption assumption in Dolev-Yao adversaries (Q557896) (← links)
- Metrics for labelled Markov processes (Q596029) (← links)
- A game-based abstraction-refinement framework for Markov decision processes (Q600979) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Equivalences for a biological process algebra (Q652149) (← links)
- Probabilistic communicating processes (Q672230) (← links)
- Logical characterizations of simulation and bisimulation for fuzzy transition systems (Q679804) (← links)
- Model-based testing of probabilistic systems (Q682363) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Algorithms for task allocation in ants. (A study of temporal polyethism: Theory) (Q688415) (← links)
- A hierarchy of probabilistic system types (Q703518) (← links)
- A compositional approach to defining logics for coalgebras (Q703520) (← links)
- Bisimulation and divergence (Q750163) (← links)
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Equivalence notions and model minimization in Markov decision processes (Q814474) (← links)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
- Ready to preorder: an algebraic and general proof (Q843212) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
