| R. Bruni and U. Montanari. Transactions and zero-safe nets. In H. Ehrig, G. Juhas, J. Padberg, and G. Rozenberg, editors, Unifying Petri Nets, Advances in Petri Nets, volume 2128 of Lecture Notes in Computer Science, pages 380-- 426. Springer Verlag, 2001. |
....use as logic and semantic frameworks for the de nition and analysis of languages, calculi and programming paradigms. The comparison traces di erences and analogies between the two approaches on the basis of two case studies: late calculus and lazy simply typed calculus. Two contributions [BM01a, BM01b] regard a basic avor of Tile Logic, called zero safe nets, where both the horizontal and the vertical structure are just freely generated monoids. Zero safe nets extend Petri nets with the notion of transaction and can provide a compositional semantic framework for many ccs like calculi. ....
....regard a basic avor of Tile Logic, called zero safe nets, where both the horizontal and the vertical structure are just freely generated monoids. Zero safe nets extend Petri nets with the notion of transaction and can provide a compositional semantic framework for many ccs like calculi. In [BM01a] rst zero safe nets are extended with read arcs (which allow for multiple access in reading to the same token) and then a distributed interpreter is de ned for the resulting framework by exploiting the net unfolding of ordinary Petri nets with read arcs. The paper [BM01b] discusses the ....
R. Bruni and U. Montanari. Transactions and zero-safe nets. In H. Ehrig, G. Juhas, J. Padberg, and G. Rozenberg, editors, Advances in Petri Nets: Unifying Petri Nets, volume 2128 of 25 2001.
No context found.
R. Bruni and U. Montanari. Transactions and zero-safe nets. In H. Ehrig, G. Juhas, J. Padberg, and G. Rozenberg, editors, Advances in Petri Nets: Unifying Petri Nets, volume 2128 of Lect. Notes in Comput. Sci., pages 380-426. Springer Verlag, 2001.
No context found.
Bruni, R. and U. Montanari, Transactions and zero-safe nets, in: H. Ehrig, G. Juhas, J. Padberg and G. Rozenberg, editors, Advances in Petri Nets: Unifying Petri Nets, Lect. Notes in Comput. Sci. 2128, Springer Verlag, 2001 pp. 380--426.
....[10, 11] Actually, since BizTalk flowgraphs may be converted into ZS nets, we find convenient to implement the latter ones of whom we have a neat understanding. Without loss of generality, we restrict to nets made with the basic shapes in Figure 4 (which are as expressive as the general nets [6]) for E any stable place and e; e 1 ; e 2 any zero places (uppercase letters denote stable places, while lowercase letters denote zero places) We remark that for ordinary Petri net transitions (i.e. without zero places) a direct encoding in join is obviously possible. We notice that the ZS net ....
R. Bruni and U. Montanari. Transactions and zero-safe nets. In Advances in Petri Nets: Unifying Petri Nets, volume 2128 of Lect. Notes in Comput. Sci., pages 380--426. Springer Verlag, 2001.
No context found.
R. Bruni and U. Montanari. Transactions and zero-safe nets. In H. Ehrig, G. Juhas, J. Padberg, and G. Rozenberg, editors, Unifying Petri Nets, Advances in Petri Nets, volume 2128 of Lecture Notes in Computer Science, pages 380-- 426. Springer Verlag, 2001.
No context found.
R. Bruni and U. Montanari. Transactions and zero-safe nets. In H. Ehrig, G. Juhas, J. Padberg, and G. Rozenberg, editors, 68 Advances in Petri Nets: Unifying Petri Nets, volume 2128 of 2001.
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