Probabilistic communicating processes
DOI10.1016/0304-3975(94)00286-0zbMATH Open0872.68111OpenAlexW4212872794MaRDI QIDQ672230FDOQ672230
Authors: Karen Seidel 
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00286-0
Recommendations
concurrencycommunicating sequential processes (CSP)conditional 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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Title not available (Why is that?)
- Reactive, generative, and stratified models of probabilistic processes
- Probabilistic self-stabilization
- Defining liveness
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- Recursion induction for real-time processes
- LOTOS extended with probabilistic behaviours
Cited In (27)
- Using Probabilistic Kleene Algebra for Protocol Verification
- Processes with probabilities, priority and time
- Title not available (Why is that?)
- A logical approach to multilevel security of probabilistic systems
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Probabilistic process algebra and strategic interleaving
- \(\pi\)-calculus with noisy channels
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Stepwise refinement of sequence diagrams with soft real-time constraints
- Refinement-oriented probability for CSP
- Coordination Models and Languages
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
- Communicating Sequential Processes. The First 25 Years
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Rational Processes Related to Communicating Markov Processes
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Hierarchical reasoning in probabilistic CSP
- A model of probabilistic processes
- A linear process-algebraic format with data for probabilistic automata
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- Additive models of probabilistic processes
- Behavioural equivalences of a probabilistic pi-calculus
- Validation of Stochastic Systems
- Title not available (Why is that?)
- Testing probabilistic equivalence through reinforcement learning
Uses Software
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)
