F. Bueno, M. V. Hermenegildo, U. Montanari, F. Rossi, Partial order and contextual net semantics for atomic and locally atomic cc programs, Science of Computer Programming 30 (1998) 51--82. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Abstractions for Fault-Tolerant Global Computing - Chothia, Duggan (2003) (1 citation) (Correct)
....pi calculus, but not in the asynchronous pi calculus. Herescu and Palamidessi [31] describe a variant of the asynchronous pi calculus with a probabilistic choice operation, and show that it is possible to implement a leadership election algorithm in this calculus. Concurrent constraint languages [47, 48, 8, 18] replace message buffers with a global store of constraints, with ask and tell operations for querying the store and adding constraints to the store, respectively. Our model does not replace message buffers in the asynchronous pi calculus, and indeed we expect that eventually (as alluded to below) ....
F. Bueno, M. V. Hermenegildo, U. Montanari, and F. Rossi. Partial order and contextual net semantics for atomic and locally atomic cc programs. Science of Computer Programming, 30:51--82, 1998.
Domain and Event Structure Semantics for Petri Nets.. - Baldan, Busi.. (2000) (1 citation) (Correct)
.... resource is read but not consumed (read only accesses) They have been used to model concurrent accesses to shared data (e.g. read operations in a database) 30, 13] to study temporal eciency in asynchronous systems [32] and to give a truly concurrent semantics to concurrent constraint programs [23, 7]. Inhibitor arcs have been introduced in [2] to solve a synchronization problem not expressible in classical Petri nets. A study of the expressiveness of inhibitor arcs, along with a comparison with other extensions proposed in the literature, namely priorities, exclusive or transitions and ....
F. Bueno, M. Hermenegildo, U. Montanari, and F. Rossi. Partial order and contextual net semantics for atomic and locally atomic CC programs. Science of Computer Programming, 30:51-82, 1998.
Axioms for Contextual Net Processes - Gadducci, Montanari (1998) (5 citations) Self-citation (Montanari) (Correct)
.... non sequential processes [22, 28] and event structures [1] Moreover, these nets naturally model read write access to shared memory, where readers are allowed to progress in parallel, with applications to transaction serializability in databases [25, 10] concurrent constraint programming [21, 3], asynchronous systems [27] and process algebras [20] Research partly supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) through the Technical University of Berlin and the University of Pisa; by the Office of Naval Information Research Contracts ....
F. Bueno, M. Hermenegildo, U. Montanari, and F. Rossi. Partial order and contextual net semantics for atomic and locally atomic CC programs. Science of Computer Programming, 30:51--82, 1998.
Abstractions for Fault-Tolerant Global Computing - Chothia, Duggan (2004) (1 citation) (Correct)
No context found.
F. Bueno, M. V. Hermenegildo, U. Montanari, F. Rossi, Partial order and contextual net semantics for atomic and locally atomic cc programs, Science of Computer Programming 30 (1998) 51--82.
An Architecture for Secure Fault-Tolerant Global Applications - Chothia, Duggan (Correct)
No context found.
F. Bueno, M. V. Hermenegildo, U. Montanari, and F. Rossi, "Partial order and contextual net semantics for atomic and locally atomic cc programs," Science of Computer Programming, vol. 30, pp. 51--82, 1998.
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