| R. Bruni and U. Montanari. Executing transactions in zero-safe nets. In M. Nielsen and D. Simpson, editors, Proceedings of ICATPN 2000, 21st Int. Conf. on Application and Theory of Petri Nets, volume 1825 of Lect. Notes in Comput. Sci., pages 83-102. Springer Verlag, 2000. |
....multisets of basic elements. They extend Petri nets with the notion of transaction atomic computation obtained via the synchronization mechanism and can provide a compositional semantic framework for many ccs like calculi. A tutorial introduction to the subject has also appeared in [BM99b] In [BM00a] a distributed interpreter for zero safe nets is de ned, which is reminiscent of the ordinary net unfolding. Finally, in [BM99a] an higher order extension of tile logic is discussed, which can provide a powerful type framework with applications to the area of reactive calculi with name passing ....
R. Bruni and U. Montanari. Executing transactions in zero-safe nets. In ICATPN2000, Int. Conf. on Application and Theory of Petri Nets, LNCS. Springer Verlag, 2000. To appear.
No context found.
R. Bruni and U. Montanari. Executing transactions in zero-safe nets. In M. Nielsen and D. Simpson, editors, Proceedings of ICATPN 2000, 21st Int. Conf. on Application and Theory of Petri Nets, volume 1825 of Lect. Notes in Comput. Sci., pages 83-102. Springer Verlag, 2000.
No context found.
R. Bruni and U. Montanari. Executing transactions in zero-safe nets. Proc. ICATPN 2000.
No context found.
R. Bruni and U. Montanari. Executing transactions in zerosafe nets. In M. Nielsen and D. Simpson, editors, Proceedings of ICATPN 2000.
....philosophies (called collective token and individual token) have been presented in [13,14] A comparison between the two approaches has been discussed in [15] in the Ph.D. Thesis of rst author [10] and in the tutorial overview [17] The distributed interpreter for zs nets has been proposed in [16]. The modeling of distributed don t know choice and the extensions of the zero safe approach to other net avours (e.g. read arcs) have not appeared elsewhere. In Section 1 we recall pt nets and their semantics. Section 2 illustrates zs nets and their operational and abstract semantics and ....
....equipped with action pre x, parallel composition, restriction and don t know nondeterministic choice. The distributed interpreter for zs nets is de ned in Section 4. We conclude in Section 5 extending the zs net formalism to deal with read arcs. For detailed proofs of most results we refer to [15,16,10]. 1 Place transition Petri nets De nition 1.1 (Net) A net is a triple N = SN ; TN ; FN ) where SN is the set of places a; a 0 ; TN is the set of transitions t; t 0 ; with SN TN = and FN (SN TN ) TN SN ) is called the ow relation. The elements of the ow ....
R. Bruni and U. Montanari. Executing Transactions in Zero-Safe Nets. In M. Nielsen, D. Simpson, editors, Proceedings ICATPN2000, Int. Conf. on Application and Theory of Petri Nets, volume 1825 of Lect. Notes in Comput. Sci., pages 83-102. Springer Verlag, 2000.
No context found.
R. Bruni and U. Montanari. Executing transactions in zerosafe nets. In M. Nielsen and D. Simpson, editors, Proc. 21st Int. Conf. on Application and Theory of Petri Nets (ICATPN pages 83-102. Springer, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC