scientific article; zbMATH DE number 7453970
From MaRDI portal
Publication:5020951
Publication date: 7 January 2022
Full work available at URL: https://arxiv.org/abs/1904.12829
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Fundamentals of compositional rewriting theory ⋮ Unnamed Item ⋮ Rewriting theory for the life sciences: a unifying theory of CTMC semantics ⋮ Concurrency theorems for non-linear rewriting theories
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unfolding semantics of graph transformation
- Amalgamation of graph transformations: a synchronization mechanism
- Formal molecular biology
- Fundamentals of algebraic graph transformation
- Unfolding Grammars in Adhesive Categories
- Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
- A Software Package for Chemically Inspired Graph Transformation
- Rule-Based Modelling, Symmetries, Refinements
- Rule-Based Modelling of Cellular Signalling
- Resolution-Like Theorem Proving for High-Level Conditions
- Sesqui-Pushout Rewriting
- Correctness of high-level transformation systems relative to nested conditions
- Handbook of Graph Grammars and Computing by Graph Transformation
- Stochastic mechanics of graph rewriting
- Finitary $\mathcal{M}$ -Adhesive Categories
- Multi-Amalgamation in Adhesive Categories
- Abstract graph derivations in the double pushout approach
- Adhesive and quasiadhesive categories
- Abstract Interpretation of Cellular Signalling Networks
- 50 Shades of Rule Composition
- Processes and unfoldings: concurrent computations in adhesive categories
- Multi-amalgamation of rules with application conditions in -adhesive categories
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Foundations of Software Science and Computation Structures
This page was built for publication:
