communicating sequential processes (CSP)concurrencyconditional probability measures of infinite tracescorrectness of probabilistic algorithmsprobability measures on the space of infinite tracesproof rules for the deterministic properties of probabilistic algorithmsself-stabilising tokenringspecification of distributed systems
Recommendations
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- Bisimulation through probabilistic testing
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- Defining liveness
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3638844 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- LOTOS extended with probabilistic behaviours
- Probabilistic self-stabilization
- Reactive, generative, and stratified models of probabilistic processes
- Recursion induction for real-time processes
Cited in
(32)- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Processes with probabilities, priority and time
- Probabilistic models for the guarded command language
- Additive models of probabilistic processes
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Stepwise refinement of sequence diagrams with soft real-time constraints
- Refinement-oriented probability for CSP
- \(\pi\)-calculus with noisy channels
- scientific article; zbMATH DE number 4173054 (Why is no real title available?)
- Behavioural equivalences of a probabilistic pi-calculus
- scientific article; zbMATH DE number 4050975 (Why is no real title available?)
- Testing probabilistic equivalence through reinforcement learning
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- scientific article; zbMATH DE number 1231649 (Why is no real title available?)
- scientific article; zbMATH DE number 1324652 (Why is no real title available?)
- scientific article; zbMATH DE number 1324654 (Why is no real title available?)
- scientific article; zbMATH DE number 1318512 (Why is no real title available?)
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- Probabilistic process algebra and strategic interleaving
- A logical approach to multilevel security of probabilistic systems
- Validation of Stochastic Systems
- Rational Processes Related to Communicating Markov Processes
- Using Probabilistic Kleene Algebra for Protocol Verification
- Communicating Sequential Processes. The First 25 Years
- Coordination Models and Languages
- A model of probabilistic processes
- Hierarchical reasoning in probabilistic CSP
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
- A linear process-algebraic format with data for probabilistic automata
This page was built for publication: Probabilistic communicating processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672230)
