Petri nets: basic notions, structure, behaviour
Current trends in concurrency. Overviews and tutorials
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
An order-based algorithm for implementing multiparty synchronization: Research Articles
Concurrency and Computation: Practice & Experience
Synchronization Algorithms and Concurrent Programming
Synchronization Algorithms and Concurrent Programming
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Observing Branching Structure through Probabilistic Contexts
SIAM Journal on Computing
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
The Algebra of Connectors—Structuring Interaction in BIP
IEEE Transactions on Computers
On the Expressive Power of Schedulers in Distributed Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Markov decision Petri net and Markov decision well-formed net formalisms
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Synthesis of distributed control through knowledge accumulation
CAV'11 Proceedings of the 23rd international conference on Computer aided 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
Code mutation in verification and automatic code correction
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A Constrained Probabilistic Petri Net Framework for Human Activity Detection in Video
IEEE Transactions on Multimedia
Probabilistic may/must testing: retaining probabilities by restricted schedulers
Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan
GSPNs Revisited: Simple Semantics and New Analysis Algorithms
ACSD '12 Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Hi-index | 0.00 |
In concurrent systems, the choice of executing the next transition depends both on the timing between the agents that make independent or collaborative interactions available, and on the conflicts (nondeterministic choices) with other transitions. This creates a challenging modeling and implementation problem. When the system needs to make also probabilistic choices, the situation becomes even more complicated. We use the model of Petri nets to demonstrate the modeling and implementation problem. The proposed solution involves adding sequential observers called agents to the Petri net structure. Distributed probabilistic choices are facilitated in the presence of concurrency and nondeterminism, by selecting agents that make the choices, while guaranteeing that their view is temporarily stable. We provide a distributed scheduling algorithm for implementing a system that allows distributed probabilistic choice.