A projective formalism applied to topological and probabilistic event structures

Authors:
Samy Abbes
Affiliations:
University of Cambridge Computer Laboratory, William Gates Building, 15 J.J. Thomson Avenue, Cambridge CB3 0FD, U.K.
Venue:
Mathematical Structures in Computer Science
Year:
2007

Citing 5
Cited 2

A probabilistic powerdomain of evaluations

Proceedings of the Fourth Annual Symposium on Logic in computer science
A metric for traces

Information Processing Letters
Metric semantics for true concurrent real time

Theoretical Computer Science
True-concurrency probabilistic models branching cells and distributed probabilities for event structures

Information and Computation
Projective topology on bifinite domains and applications

Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models

True-concurrency probabilistic models: Markov nets and a law of large numbers

Theoretical Computer Science
Concurrency, σ -Algebras, and Probabilistic Fairness

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces projective systems for topological and probabilistic event structures. The projective formalism is used for studying the domain of configurations of a prime event structure and its space of maximal elements. This is done from both a topological and a probabilistic viewpoint. We give probability measure extension theorems in this framework.