A calculus of concurrent graph-rewriting processes

DOI10.1016/J.JLAMP.2019.100500MaRDI QIDQ2291821zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

process calculiasynchronous transition systemscontrolled graph rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Equivalence and independence in controlled graph-rewriting processes
• Graph-rewriting Petri nets
• Concurrent Rewriting for Graphs with Equivalences
• Concurrent graph and term graph rewriting
• scientific article; zbMATH DE number 7020157

Cites work

• scientific article; zbMATH DE number 1629836 (Why is no real title available?)
• scientific article; zbMATH DE number 1701353 (Why is no real title available?)
• scientific article; zbMATH DE number 5761737 (Why is no real title available?)
• scientific article; zbMATH DE number 177436 (Why is no real title available?)
• scientific article; zbMATH DE number 3630234 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• scientific article; zbMATH DE number 919845 (Why is no real title available?)
• scientific article; zbMATH DE number 919850 (Why is no real title available?)
• scientific article; zbMATH DE number 1437942 (Why is no real title available?)
• A calculus of communicating systems
• A kernel language for programmed rewriting of (hyper)graphs
• Action refinement.
• An event structure semantics for graph grammars with parallel productions
• Efficient unfolding of contextual Petri nets
• Equivalence and independence in controlled graph-rewriting processes
• Foundations of Software Science and Computation Structures
• Fundamentals of algebraic graph transformation
• Graph transformations in computer science. International Workshop, Dagstuhl Castle, Germany, January 4--8, 1993. Proceedings
• Handbook of Graph Grammars and Computing by Graph Transformation
• Introduction to concurrency theory. Transition systems and CCS
• Note on standard representation of graphs and graph derivations
• On relating rewriting systems and graph grammars to event structures
• Strategic port graph rewriting: an interactive modelling framework
• Towards a unified approach to encodability and separation results for process calculi
• Towards the Verification of Attributed Graph Transformation Systems
• Universal coalgebra: A theory of systems

Cited in

(7)

• Preface to the special issue on the 11th international conference on graph transformation
• Formal Methods in Software and Systems Modeling
• Graph-rewriting Petri nets
• A higher-order graph calculus for autonomic computing
• Graph rewriting for the π-calculus
• Equivalence and independence in controlled graph-rewriting processes
• Introducing symmetry to graph rewriting systems with process abstraction

Describes a project that uses

Uses Software

• Augur 2
• PROGRES

This page was built for publication: A calculus of concurrent graph-rewriting processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291821)