scientific article; zbMATH DE number 7453087
From MaRDI portal
Publication:5020536
Recommendations
- Sesqui-Pushout Rewriting
- A generalized concurrent rule construction for double-pushout rewriting
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- Sesqui-pushout rewriting with type refinements
- Rewriting logic as a semantic framework for concurrency: a progress report
- Polymorphic sesqui-pushout graph rewriting
- Double-pushout rewriting in context: rule composition and parallel independence
- A formalization of sequential, parallel, and continuous rewriting
- From rewrite rules to bisimulation congruences
- Confluence of algebraic rewriting systems
Cites work
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Adhesive and quasiadhesive categories
- AGREE -- algebraic graph rewriting with controlled embedding
- Algebraic approach to single-pushout graph transformation
- Boson normal ordering via substitutions and Sheffer-type polynomials
- Characterisation of parallel independence in AGREE-rewriting
- Combinatorial algebra for second-quantized quantum theory
- Combinatorial models of creation-annihilation
- Continuous-time Markov chains. An applications-oriented approach
- Finitary \(\mathcal{M}\)-adhesive categories
- Formal molecular biology
- Graph Transformations
- Graph Transformations
- Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 177452 (Why is no real title available?)
- Lie Groups, Lie Algebras, and Representations
- Markov Chains
- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
- Parallelism and concurrency in high-level replacement systems
- Parallelism and concurrency of stochastic graph transformations
- Polymorphic sesqui-pushout graph rewriting
- Probabilistic graph transformation systems
- Probabilistic timed graph transformation systems
- Restriction categories II: Partial map classification
- Rule algebras for adhesive categories
- Rule-Based Modelling, Symmetries, Refinements
- Sesqui-Pushout Rewriting
- Stochastic mechanics of graph rewriting
- Theoretical Aspects of Computing – ICTAC 2005
Cited in
(13)- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- Concurrency theorems for non-linear rewriting theories
- A generalized concurrent rule construction for double-pushout rewriting
- Rule algebras for adhesive categories
- Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
- scientific article; zbMATH DE number 7453970 (Why is no real title available?)
- scientific article; zbMATH DE number 7456054 (Why is no real title available?)
- scientific article; zbMATH DE number 7456055 (Why is no real title available?)
- scientific article; zbMATH DE number 7456060 (Why is no real title available?)
- Fundamentals of compositional rewriting theory
- Tracelet Hopf algebras and decomposition spaces (extended abstract)
- Stochastic graph transformation for social network modeling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020536)
