A lattice theoretic view of K-density
Advances in Petri Nets 1984
Nonsequential processes
Branching processes of Petri nets
Acta Informatica
Executions: a new partial-order semantics of Petri nets
Theoretical Computer Science
SIAM Journal on Control and Optimization
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Free choice Petri nets
On the border of causality: contact and confusion
Theoretical Computer Science - Special volume on Petri nets
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
The Book of Traces
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
Fault Detection and Diagnosis in Distributed Systems: An Approach by Partially Stochastic Petri Nets
Discrete Event Dynamic Systems
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
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
Generalized Stochastic Petri Nets Revisitied: Random Switches and Priorities
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Randomized Non-sequential Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Monitoring Discrete Event Systems Using Petri Net Embeddings
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Blocking a transition in a free choice net and what it tells about its throughput
Journal of Computer and System Sciences
Clusters, Confusion and Unfoldings
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Fundamenta Informaticae
| Hi-index | 0.00 |
This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets with no structural or safety assumptions. The unfolding is constructed by local choices on each cluster (conflict closed subnet), while the authorization for cluster actions is governed by a stochastic trace, the policy. The probabilistic model for this semantics yields probability measures for concurrent runs. We introduce and characterize stopping times for this model, and prove a strong Markov property. Particularly adequate probability measures for the choice of step in a cluster, as well as for the policy, are obtained by constructing Markov Fields from suitable marking-dependent Gibbs potentials.