Probabilistic extensions of process algebras.
From MaRDI portal
Recommendations
Cited in
(55)- Bialgebraic methods and modal logic in structural operational semantics
- LOTOS extended with probabilistic behaviours
- Algebraic theory of probabilistic and nondeterministic processes.
- Algebraic theory of probabilistic processes.
- SOS specifications for uniformly continuous operators
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- Probabilistic divide \& congruence: branching bisimilarity
- Specification, testing and implementation relations for symbolic-probabilistic systems
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator
- A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
- Modular construction of complete coalgebraic logics
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
- A modular approach to defining and characterising notions of simulation
- A general SOS theory for the specification of probabilistic transition systems
- GSOS for probabilistic transition systems (extended abstract)
- Remarks on testing probabilistic processes
- Labelled Markov processes as generalised stochastic relations
- Notes on generative probabilistic bisimulation
- On probabilistic techniques for data flow analysis
- Modular games for coalgebraic fixed point logics
- A general framework for probabilistic characterizing formulae
- A formalized hierarchy of probabilistic system types. Proof pearl
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Bisimulations meet PCTL equivalences for probabilistic automata
- Model checking probabilistic systems
- From Gene Regulation to Stochastic Fusion
- Value-passing CCS with noisy channels
- Consistency and refinement for interval Markov chains
- Equational reasonings in wireless network gossip protocols
- Linear Structures for Concurrency in Probabilistic Programming Languages
- CoLoSS: the coalgebraic logic satisfiability solver
- The sub-additives: a proof theory for probabilistic choice extending linear logic
- Compositional weak metrics for group key update
- Coalgebraic modal logic beyond sets
- Differential privacy in probabilistic systems
- Validation of Stochastic Systems
- Probabilistic bisimulation
- Constraint Markov chains
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Measuring the confinement of probabilistic systems
- CONCUR 2003 - Concurrency Theory
- Quantitative relations and approximate process equivalences.
- Symbolic approaches to probability distributions in process algebra
- Back to the format: a survey on SOS for probabilistic processes
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
- Filling out the gaps: a padding algorithm for transforming out timing leaks
- A hierarchy of probabilistic system types
- Process-algebraic approaches for multi-agent systems: an overview
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- Model independent approach to probabilistic models
- Switched PIOA: parallel composition via distributed scheduling
- Fair testing
- Parametric probabilistic transition systems for system design and analysis
- Making random choices invisible to the scheduler
- Tempus fugit: How to plug it
This page was built for publication: Probabilistic extensions of process algebras.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760248)
