Petri nets: an introduction
Behaviour preserving refinements of Petri nets
International Workshop WG '86 on Graph-theoretic concepts in computer science
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
A survey of behaviour and equivalence preserving refinements of Petri nets
APN 90 Proceedings on Advances in Petri nets 1990
Process versus unfolding semantics for place/transition Petri nets
Theoretical Computer Science - Special volume on Petri nets
Zero-safe nets: comparing the collective and individual token approaches
Information and Computation - Special issue on EXPRESS 1997
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Zero-safe nets: The individual token approach
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
General Refinement and Recursion Operators for the Petri Box Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Comments on capabilities, limitations and “correctness” of Petri nets
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Algorithms for signal and message asynchronous communication mechanisms and their analysis
Fundamenta Informaticae - Application of concurrency to system design
Two Problems in Wide Area Network Programming
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Transactions and Zero-Safe Nets
Unifying Petri Nets, Advances in Petri Nets
Concurrent models for Linda with transactions
Mathematical Structures in Computer Science
Petri Net Processes for Zero-Safe Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Linear Properties of Zero-Safe Nets with Debit Tokens
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Linear Properties of Zero-Safe Nets with Debit Tokens
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Petri Net Processes for Zero-Safe Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Algorithms for Signal and Message Asynchronous Communication Mechanisms and their Analysis
Fundamenta Informaticae - Application of Concurrency to System Design
Petri nets for the verification of ubiquitous systems with transient secure association
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
On negotiation as concurrency primitive
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
Distributed systems are often composed by many heterogeneous agents that can work concurrently and exchange information. Therefore, in their modeling via pt nets we must be aware that the basic activities of each system can vary in duration and can be constituted by smaller internal activities, i.e., transitions are conceptually refined into transactions. We address the issue of modeling transactions in distributed systems by using zero-safe nets, which extend pt nets with a simple mechanism for transition synchronization. In particular, starting from the zero-safe net that represents a certain system, we give a distributed algorithm for executing the transactions of the system as transitions of a more abstract pt net. Among the advantages of our approach, we emphasize that the zero-safe net can be much smaller than its abstract counterpart, due to the synchronization mechanism.