CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68676OpenAlexW2499482941MaRDI QIDQ5311494

Daniele Varacca, Glynn Winskel, Hagen Völzer

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100113

zbMATH Keywords

probabilitycausalityconcurrencydomain theoryevent structures

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Continuous probability distributions in concurrent games ⋮ Semantic domains of timed event structures ⋮ Projective topology on bifinite domains and applications ⋮ Measure Properties of Game Tree Languages ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ On the Origin of Events: Branching Cells as Stubborn Sets ⋮ True-concurrency probabilistic models: Markov nets and a law of large numbers ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures ⋮ Unnamed Item ⋮ Probabilistic event structures and domains ⋮ A Bayesian Model for Event-based Trust ⋮ Probabilistic Configuration Theories

This page was built for publication: CONCUR 2004 - Concurrency Theory