The following pages link to (Q2760248):
Displaying 44 items.
- Value-passing CCS with noisy channels (Q428864) (← links)
- Consistency and refinement for interval Markov chains (Q444461) (← links)
- Differential privacy in probabilistic systems (Q529047) (← links)
- Constraint Markov chains (Q554215) (← links)
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- A hierarchy of probabilistic system types (Q703518) (← links)
- Process-algebraic approaches for multi-agent systems: an overview (Q814895) (← links)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Fair testing (Q865623) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- Tempus fugit: How to plug it (Q997994) (← links)
- Bialgebraic methods and modal logic in structural operational semantics (Q1012126) (← links)
- Algebraic theory of probabilistic processes. (Q1400293) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems (Q1697986) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- Specification, testing and implementation relations for symbolic-probabilistic systems (Q2368993) (← links)
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator (Q2372202) (← links)
- A framework for analyzing probabilistic protocols and its application to the partial secrets exchange (Q2463563) (← links)
- Modular construction of complete coalgebraic logics (Q2464936) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- A modular approach to defining and characterising notions of simulation (Q2495641) (← links)
- A general SOS theory for the specification of probabilistic transition systems (Q2629851) (← links)
- GSOS for probabilistic transition systems (Q2842551) (← links)
- Remarks on Testing Probabilistic Processes (Q2864156) (← links)
- Labelled Markov Processes as Generalised Stochastic Relations (Q2864159) (← links)
- Notes on Generative Probabilistic Bisimulation (Q2866317) (← links)
- On Probabilistic Techniques for Data Flow Analysis (Q2870284) (← links)
- Modular Games for Coalgebraic Fixed Point Logics (Q2873663) (← links)
- A General Framework for Probabilistic Characterizing Formulae (Q2891432) (← links)
- A Formalized Hierarchy of Probabilistic System Types (Q2945633) (← links)
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi (Q2974795) (← links)
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- From Gene Regulation to Stochastic Fusion (Q3543333) (← links)
- (Q4553277) (← links)
- Linear Structures for Concurrency in Probabilistic Programming Languages (Q4923370) (← links)
- CoLoSS: The Coalgebraic Logic Satisfiability Solver (Q4982113) (← links)
- (Q5089025) (← links)
- Compositional weak metrics for group key update (Q5111289) (← links)
- Coalgebraic Modal Logic Beyond Sets (Q5262938) (← links)
- Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)
