True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures

DOI10.1016/j.ic.2005.10.001zbMath1093.68059MaRDI QIDQ2490114

Albert Benveniste, Samy Abbes

Publication date: 28 April 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.10.001

Mathematics Subject Classification ID

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

Related Items

A projective formalism applied to topological and probabilistic event structures, Projective topology on bifinite domains and applications, Partial order techniques for distributed discrete event systems: why you cannot avoid using them, True-concurrency probabilistic models: Markov nets and a law of large numbers, On the Origin of Events: Branching Cells as Stubborn Sets, Concurrency, σ-Algebras, and Probabilistic Fairness, Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Retracted: Semantic domains for combining probability and non-determinism
• Concrete domains
• True-concurrency probabilistic models: Markov nets and a law of large numbers
• An Extension Result for Continuous Valuations
• Continuous Lattices and Domains
• Free Choice Petri Nets
• Markov nets: probabilistic models for distributed and concurrent systems
• CONCUR 2004 - Concurrency Theory
• Foundations of Software Science and Computational Structures