A calculus of concurrent graph-rewriting processes
From MaRDI portal
Publication:2291821
DOI10.1016/J.JLAMP.2019.100500zbMath1494.68115OpenAlexW2981095646WikidataQ127006215 ScholiaQ127006215MaRDI QIDQ2291821
Géza Kulcsár, Andrea Corradini, Malte Lochau
Publication date: 31 January 2020
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2019.100500
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient unfolding of contextual Petri nets
- Introduction to concurrency theory. Transition systems and CCS
- A calculus of communicating systems
- Graph transformations in computer science. International Workshop, Dagstuhl Castle, Germany, January 4--8, 1993. Proceedings
- Universal coalgebra: A theory of systems
- Equivalence and independence in controlled graph-rewriting processes
- A kernel language for programmed rewriting of (hyper)graphs
- Towards a unified approach to encodability and separation results for process calculi
- Fundamentals of algebraic graph transformation
- Towards the Verification of Attributed Graph Transformation Systems
- Handbook of Graph Grammars and Computing by Graph Transformation
- Strategic port graph rewriting: an interactive modelling framework
- An event structure semantics for graph grammars with parallel productions
- Note on standard representation of graphs and graph derivations
- On relating rewriting systems and graph grammars to event structures
- Foundations of Software Science and Computation Structures
This page was built for publication: A calculus of concurrent graph-rewriting processes
