Probabilistic communicating processes

DOI10.1016/0304-3975(94)00286-0zbMath0872.68111OpenAlexW4212872794MaRDI QIDQ672230

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Refinement-oriented probability for CSP ⋮ Behavioural equivalences of a probabilistic pi-calculus ⋮ Testing probabilistic equivalence through reinforcement learning ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ \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 ⋮ Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language ⋮ A logical approach to multilevel security of probabilistic systems ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ \(\pi\)-calculus with noisy channels ⋮ Additive models of probabilistic processes ⋮ Stepwise refinement of sequence diagrams with soft real-time constraints

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic self-stabilization
• Defining liveness
• Bisimulation through probabilistic testing
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• LOTOS extended with probabilistic behaviours
• Recursion induction for real-time processes
• Reactive, generative, and stratified models of probabilistic processes
• A lattice-theoretical fixpoint theorem and its applications