Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
Non-interleaving semantics for mobile processes
Theoretical Computer Science
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
The Category of Typed Graph Grammars and its Adjunctions with Categories
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
On Relating Rewriting Systems and Graph Grammars to Event Structures
Proceedings of the International Workshop on Graph Transformations in Computer Science
An Event Structure Semantics for Graph Grammars with Parallel Productions
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
A Chart Semantics for the Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Ugo Montanari and Graph Transformation
Concurrency, Graphs and Models
Unfolding Graph Transformation Systems: Theory and Applications to Verification
Concurrency, Graphs and Models
Ugo Montanari and Concurrency Theory
Concurrency, Graphs and Models
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Typed event structures and the linear π-calculus
Theoretical Computer Science
Event structure semantics of Orc
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Event structure semantics of parallel extrusion in the pi-calculus
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal calculi have been modeled with graph grammars, and hence their event structure semantics could be obtained as instances of the general case, the main limitation is that in the case of graph grammars the construction is more complex than strictly necessary for dealing with usual nominal calculi and, speaking in categorical terms, it is not as elegant as in the case of Petri nets. The main contribution of this work is the definition of a particular class of graph grammars, called persistent, that are expressive enough to model name passing calculi while simplifying the denotational domain construction, which can be expressed as an adjunction. Finally, we apply our technique to derive event structure semantics for pi-calculus and join-calculus processes.