Unfolding semantics of graph transformation
From MaRDI portal
Recommendations
Cites work
- Adhesive and quasiadhesive categories
- Algebraic approach to single-pushout graph transformation
- Categories of partial maps
- CONCUR 2004 - Concurrency Theory
- Concurrent graph and term graph rewriting
- Contextual nets
- Contextual Petri nets, asymmetric event structures, and processes
- Coreflective concurrent semantics for single-pushout graph grammars.
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Efficiency of asynchronous systems and read arcs in petri nets
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 4018370 (Why is no real title available?)
- scientific article; zbMATH DE number 140240 (Why is no real title available?)
- scientific article; zbMATH DE number 1330131 (Why is no real title available?)
- scientific article; zbMATH DE number 1504833 (Why is no real title available?)
- scientific article; zbMATH DE number 1863175 (Why is no real title available?)
- scientific article; zbMATH DE number 919845 (Why is no real title available?)
- scientific article; zbMATH DE number 1405645 (Why is no real title available?)
- scientific article; zbMATH DE number 969071 (Why is no real title available?)
- On the nature of events: another perspective in concurrency
- On the semantics of place/transition Petri nets
- Parallelism and concurrency in high-level replacement systems
- Petri nets are monoids
- Petri nets, algebras, morphisms, and compositionality
- Petri nets, event structures and domains. I
- Process versus unfolding semantics for Place/Transition Petri nets
- Semantics of inhibitor nets
- The category of typed graph grammars and its adjunctions with categories of derivations
- The non-sequential behaviour of Petri nets
Cited in
(20)- Unfolding-based diagnosis of systems with an evolving topology
- Unfolding graph grammars with negative application conditions
- Unfolding Grammars in Adhesive Categories
- An institution for graph transformation
- Ugo Montanari and Graph Transformation
- Unfolding Graph Transformation Systems: Theory and Applications to Verification
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- Unfolding-Based Diagnosis of Systems with an Evolving Topology
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- scientific article; zbMATH DE number 1330131 (Why is no real title available?)
- Verification of graph grammars using a logical approach
- scientific article; zbMATH DE number 1504833 (Why is no real title available?)
- The true concurrency of differential interaction nets
- scientific article; zbMATH DE number 7453970 (Why is no real title available?)
- scientific article; zbMATH DE number 7456052 (Why is no real title available?)
- Unfolding Symbolic Attributed Graph Grammars
- Formal verification of graph grammars using mathematical induction
- Processes and unfoldings: concurrent computations in adhesive categories
- Coreflective concurrent semantics for single-pushout graph grammars.
- A framework for the verification of infinite-state graph transformation systems
This page was built for publication: Unfolding semantics of graph transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879600)
