Structure theory of Petri nets: the free choice hiatus
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Parallel program design: a foundation
Parallel program design: a foundation
Nonsequential processes
Reasoning about probabilistic algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Branching processes of Petri nets
Acta Informatica
Information and Computation
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
On the border of causality: contact and confusion
Theoretical Computer Science - Special volume on Petri nets
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the DIMACS workshop on Partial order methods in verification
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
On the verification of qualitative properties of probabilistic processes under fairness constraints
Information Processing Letters
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modelling with Generalized Stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Distributed Algorithms for Networks of Agents
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Proceedings of the Conference on Logic of Programs
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Modeling and Verification of Randomized Distributed Real -Time Systems
Modeling and Verification of Randomized Distributed Real -Time Systems
Symmetry breaking in distributive networks
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Probabilistic Unfoldings and Partial Order Fairness in Petri Nets
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
The (true) concurrent markov property and some applications to markov nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Branching cells as local states for event structures and nets: probabilistic applications
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Probabilistic Cluster Unfoldings
Fundamenta Informaticae
| Hi-index | 0.00 |
A non-sequential, i.e. "true concurrency", semantics for randomized distributed algorithms is suggested. It is based on Petri nets and their branching processes. We introduce randomized Petri nets and their semantics, probabilistic branching processes. As a main result, we show that each probabilistic branching process defines a unique canonical probability space. Finally, we show that the non-sequential semantics differs from the classical sequential semantics, modelling a new adversary, called the distributed adversary.