# On probabilistic stable event structures

@article{Ghahremani2020OnPS, title={On probabilistic stable event structures}, author={Nargess Ghahremani and Julian Bradfield}, journal={ArXiv}, year={2020}, volume={abs/2012.10188} }

Verification has been a core concern of theoretical computer science for several decades. As most real systems are in some sense distributed or concurrent, one has to decide how to model concurrency. Broadly, there are two schools: the interleaving approach imposes a global ‘clock’ on the system, and says that independent concurrent events occur in some order, but that order is arbitrary – encapsulated by the CCS interleaving law a|b = a.b+ b.a. ‘True concurrency’, on the other hand, represents… Expand

#### References

SHOWING 1-10 OF 34 REFERENCES

Petri nets, probability and event structures

- Computer Science
- 2014

This thesis defines a new and more compact unfoldings of safe Petri nets which is directly translatable to stable event structures, and defines a probabilistic logic over Probabilistic event structures (PESL), believed to be the first probabilism logic of true concurrency. Expand

Distributed Markov Chains

- Computer Science
- VMCAI
- 2015

This work studies a class of communicating probabilistic agents in which the synchronizations determine the probability distribution for the next moves of the participating agents, and defines an interleaved semantics that can be used to efficiently verify properties of the global Markov chain represented by the network. Expand

Formal verification of probabilistic systems

- Computer Science
- 1997

This dissertation presents methods for the formal modeling and specification of probabilistic systems, and algorithms for the automated verification of these systems, which rely on the theory of Markov decision processes and exploit a connection between the graph-theoretical and Probabilistic properties of these processes. Expand

Event Structures

- Computer Science
- Advances in Petri Nets
- 1986

The mathematical theory of event structures is presented, how they are related to Petri nets and Scott domains, and how they can be used to provide semantics to programming languages for parallel processes as welt as languages with higher types are surveyed. Expand

Markov nets: probabilistic models for distributed and concurrent systems

- Computer Science
- IEEE Trans. Autom. Control.
- 2003

This paper develops a generalization of Markov chains and hidden Markov models for distributed and concurrent systems, and follows a so-called true concurrency approach, in which neither global state nor global time are available. Expand

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

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2008

A Law of Large Numbers (LLN) is proved for Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics, which allows for the characterization, in a quantitative way, of the asymptotic behavior of Markovnets. Expand

Modeling and verification of randomized distributed real-time systems

- Computer Science
- 1995

Theoretical work builds a new mathematical model of randomized distributed computation and develops techniques to prove the correctness of some property by reducing the problem to the verification of properties of non-randomized systems. Expand

Semantic Domains for Combining Probability and Non-Determinism

- Computer Science
- Electron. Notes Theor. Comput. Sci.
- 2009

This work combines the well-known domains modelling nondeterminism - the lower, upper and convex powerdomains, with the probabilistic powerdomain of Jones and Plotkin, and shows that the semantic domains work well for the language used by Morgan and McIver. Expand

Probabilistic ω-automata

- Mathematics, Computer Science
- JACM
- 2012

This paper addresses closure properties under the Boolean operators union, intersection and complementation and algorithmic aspects, such as checking emptiness or language containment, and provides a comparison of probabilistic ω-automata concerning expressiveness and efficiency. Expand

Probabilistic Simulations for Probabilistic Processes

- Computer Science
- Nord. J. Comput.
- 1995

The interesting properties of a system are identified with those that are expressible in an untimed version of the Timed Probabilistic concurrent Computation Tree Logic (TPCTL) of Hansson. Expand