A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Probability
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Free choice Petri nets
The Book of Traces
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
On the origin of events: branching cells as stubborn sets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
| Hi-index | 0.01 |
This paper is devoted to probabilistic models for concurrent systems under their true-concurrency semantics. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite, that extend confusion-free event structure. In locally finite event structures, maximal configurations can be tiled with branching cells: branching cells are minimal and finite sub-structures capturing the choices performed while scanning a maximal configuration. The probabilistic event structures that we introduce have the property that ''concurrent processes are independent in the probabilistic sense.''