Pages that link to "Item:Q1356940"
From MaRDI portal
The following pages link to Probabilistic models for the guarded command language (Q1356940):
Displayed 33 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Relations into algebras of probabilistic distributions (Q406461) (← links)
- Compositional noninterference from first principles (Q432152) (← links)
- Probabilistic rely-guarantee calculus (Q507375) (← links)
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language (Q652158) (← links)
- Denotational semantics and its algebraic derivation for an event-driven system-level language (Q903516) (← links)
- Using probabilistic Kleene algebra pKA for protocol verification (Q929968) (← links)
- Domain semantics of possibility computations (Q1031684) (← links)
- Reasoning about faulty quantum programs (Q1031864) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- A UTP approach for rTiMo (Q1624596) (← links)
- Dynamic intransitive noninterference revisited (Q1688559) (← links)
- Semantics of non-deterministic possibility computation (Q1759727) (← links)
- Semantic inheritance in unifying theories of programming (Q1941890) (← links)
- A unification of probabilistic choice within a design-based model of reversible computation (Q1941891) (← links)
- Linking theories in probabilistic programming (Q1961866) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Enhancing probabilistic model checking with ontologies (Q2065528) (← links)
- Theoretical and practical approaches to the denotational semantics for MDESL based on UTP (Q2198135) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities (Q2253178) (← links)
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes (Q2257984) (← links)
- Compiling quantum programs (Q2484067) (← links)
- Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations (Q2830042) (← links)
- Remarks on Testing Probabilistic Processes (Q2864156) (← links)
- Lattice-valued Scott topology on dcpos (Q2971118) (← links)
- How to Brew-up a Refinement Ordering (Q2994493) (← links)
- Data Refinement with Probability in Mind (Q2994495) (← links)
- Unifying Theories of Programming with Monads (Q3455643) (← links)
- Denotational Semantics for a Probabilistic Timed Shared-Variable Language (Q3455653) (← links)
- A Generalisation of Stationary Distributions, and Probabilistic Program Algebra (Q4917061) (← links)
- Hidden-Markov program algebra with iteration (Q5740625) (← links)
- Partial correctness for probabilistic demonic programs (Q5958768) (← links)