Unfolding semantics of graph transformation
From MaRDI portal
Publication:879600
DOI10.1016/j.ic.2006.11.004zbMath1115.68093OpenAlexW1996402690MaRDI QIDQ879600
Ugo Montanari, Paolo Baldan, Andrea Corradini, Leila Ribeiro
Publication date: 14 May 2007
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2006.11.004
Related Items (15)
Unfolding Grammars in Adhesive Categories ⋮ An Institution for Graph Transformation ⋮ The true concurrency of differential interaction nets ⋮ Unfolding Symbolic Attributed Graph Grammars ⋮ Ugo Montanari and Graph Transformation ⋮ Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ Verification of graph grammars using a logical approach ⋮ Unfolding-based diagnosis of systems with an evolving topology ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unfolding-Based Diagnosis of Systems with an Evolving Topology ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ Processes and unfoldings: concurrent computations in adhesive categories ⋮ Formal Verification of Graph Grammars using Mathematical Induction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Process versus unfolding semantics for Place/Transition Petri nets
- On the nature of events: another perspective in concurrency
- Algebraic approach to single-pushout graph transformation
- Petri nets are monoids
- Petri nets, algebras, morphisms, and compositionality
- Categories of partial maps
- Petri nets, event structures and domains. I
- Contextual Petri nets, asymmetric event structures, and processes
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Contextual nets
- Semantics of inhibitor nets
- The non-sequential behaviour of Petri nets
- Parallelism and concurrency in high-level replacement systems
- On the semantics of place/transition Petri nets
- Handbook of Graph Grammars and Computing by Graph Transformation
- Efficiency of asynchronous systems and read arcs in petri nets
- The category of typed graph grammars and its adjunctions with categories of derivations
- CONCUR 2004 - Concurrency Theory
- Adhesive and quasiadhesive categories
- Recent Trends in Algebraic Development Techniques
- Concurrent graph and term graph rewriting
This page was built for publication: Unfolding semantics of graph transformation