Denotational semantics for probabilistic and concurrent programs

DOI10.4230/LIPICS.CONCUR.2025.39MaRDI QIDQ7310320zbMATH OpenFDO

Authors Noam Zilberstein, Daniele Gorla, Alexandra Silva

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.39

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A denotational semantics for SPARC TSO
• A Powerdomain Construction
• Abstraction, Refinement and Proof for Probabilistic Systems
• An assertion-based program logic for probabilistic programs
• An axiomatic basis for computer programming
• Applications of compactness in the Smyth powerdomain of streams
• Axioms for probability and nondeterminism
• Branching Pomsets for Choreographies
• Branching pomsets: design, expressiveness and applications to choreographies
• Category Theory
• Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
• Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
• CONCUR 2004 - Concurrency Theory
• Concurrent Kleene algebra and its foundations
• Concurrent Kleene algebra with observations: from hypotheses to completeness
• Concurrent Kleene algebra with tests and branching automata
• Countable nondeterminism and random assignment
• Counting large numbers of events in small registers
• Distributing probability over non-determinism
• scientific article; zbMATH DE number 6712178 (Why is no real title available?)
• scientific article; zbMATH DE number 3662551 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 17816 (Why is no real title available?)
• scientific article; zbMATH DE number 1927580 (Why is no real title available?)
• scientific article; zbMATH DE number 1469900 (Why is no real title available?)
• scientific article; zbMATH DE number 1500556 (Why is no real title available?)
• scientific article; zbMATH DE number 1531379 (Why is no real title available?)
• scientific article; zbMATH DE number 1759622 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• Modeling concurrency with partial orders
• Multisets and distributions
• No-go theorems for distributive laws
• Power domains
• Presenting convex sets of probability distributions by convex semilattices and unique bases
• Probabilistic -calculus and event structures
• Probabilistic and quantum event structures
• Probabilistic event structures and domains
• Probabilistic models for the guarded command language
• Proving the Correctness of Multiprocess Programs
• Refinement-oriented probability for CSP
• Semantic domains for combining probability and non-determinism
• Termination of Probabilistic Concurrent Program
• The choice coordination problem
• The equational theory of pomsets
• Towards concurrent quantitative separation logic

This page was built for publication: Denotational semantics for probabilistic and concurrent programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310320)