Information Processing Letters
Fairness
Event fairness and non-interleaving concurrency
Formal Aspects of Computing
Branching processes of Petri nets
Acta Informatica
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Free choice Petri nets
Fairness and partial order semantics
Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
Modelling with Generalized Stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Fault Detection and Diagnosis in Distributed Systems: An Approach by Partially Stochastic Petri Nets
Discrete Event Dynamic Systems
Generalized Stochastic Petri Nets Revisitied: Random Switches and Priorities
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
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
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on 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
Fairness and hyperfairness in multi-party interactions
Distributed Computing
Clusters, Confusion and Unfoldings
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Probabilistic cluster unfoldings
Fundamenta Informaticae
Probabilistic Cluster Unfoldings
Fundamenta Informaticae
| Hi-index | 0.00 |
The article investigates fairness and conspiracy in a probabilistic framework, based on unfoldings of Petri nets. Here, the unfolding semantics uses a new, cluster-based view of local choice. The algorithmic construction of the unfolding proceeds on two levels, choice of steps inside conflict clusters, where the choice may be fair or unfair, and the policy controlling the order in which clusters may act; this policy may or may not conspire, e.g., against a transition. In the context of an example where conspiracy can hide in the partial order behavior of a life and 1- safe Petri net, we show that, under non-degenerate i.i.d. randomization on both levels, both conspiracy and unfair behavior have probability 0. The probabilistic model, using special Gibbs potentials, is presented here in the context of 1-safe nets, but extends to any Petri net.