R. Bruni and U. Montanari. Zero-safe net models for transactions in Linda. In U. Montanari and V. Sassone, editors, Proceedings of ConCoord 2001, International Workshop on Concurrency and Coordination, volume 54 of Elect. Notes in Th. Comput. Sci., 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Appligraph: Applications of Graph Transformation - Fifth.. - Kreowski, (eds.) (2002) (Correct)
....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. In ....
....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 conditions under which inhibitor arcs can be introduced in zero safe nets without compromising the abstract view of the system and applies contextual zero safe nets to a transactional extension of the coordination language Linda for de ning a concurrent operational semantics. ....
R. Bruni and U. Montanari. Zero-safe net models for transactions in Linda. In U. Montanari and V. Sassone, editors, Proc. Int. Workshop on Concurrency and Coordination (ConCoord 2001), volume 54 of Electronic Notes in Theoretical Computer Science, 2001.
Extending the Zero-Safe approach to Coloured.. - Bruni, Melgratti.. Self-citation (Bruni Montanari) (Correct)
No context found.
R. Bruni and U. Montanari. Zero-safe net models for transactions in Linda. In U. Montanari and V. Sassone, editors, Proceedings of ConCoord 2001, International Workshop on Concurrency and Coordination, volume 54 of Elect. Notes in Th. Comput. Sci., 2001.
Orchestrating Transactions in Join Calculus - Roberto Bruni Cosimo (2002) (4 citations) Self-citation (Bruni Montanari) (Correct)
No context found.
R. Bruni and U. Montanari. Zero-safe net models for transactions in linda. Proc. of ConCoord 2001, vol. 54 of Elect. Notes in Th. Comput. Sci., 2001.
Centralized and Distributed Orchestration of.. - Bruni, Laneve, Montanari Self-citation (Montanari) (Correct)
No context found.
R. Bruni and U. Montanari. Zero-safe net models for transactions in linda. Proc. of ConCoord 2001, vol. 54 of Elect. Notes in Th. Comput. Sci., 2001.
Orchestrating Transactions in Join Calculus - Roberto Bruni Cosimo (2002) (4 citations) Self-citation (Bruni Montanari) (Correct)
.... boxes correspond to a two level classification of states, observable (i.e. outside the box) and hidden (i.e. inside the box) This partition also pervades another formalism, which has been recently defined to model transactional aspects in concurrent systems, the zero safe Petri nets (ZS nets) [5, 7]. Actually, BizTalk flowcharts may be easily encoded into ZS nets, while the converse encoding seems not possible. The reason is that BizTalk boxes provide a somewhat static specification of transactions A transaction can be considered as a collection of actions with the following properties: ....
R. Bruni and U. Montanari. Zero-safe net models for transactions in linda. In U. Montanari and V. Sassone, editors, Proceedings of ConCoord 2001.
Appligraph: Applications of Graph Transformation - Final Report - Kreowski, (eds.) (2002) (Correct)
No context found.
R. Bruni and U. Montanari. Zero-safe net models for transactions in Linda. In U. Montanari and V. Sassone, editors, Proc. Int. Workshop on Concurrency and Coordination (ConCoord 2001), volume 54 of Electronic Notes in Theoretical Computer Science, 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