The following pages link to Andrea Corradini (Q171483):
Displayed 50 items.
- Efficient unfolding of contextual Petri nets (Q443729) (← links)
- A lattice-theoretical perspective on adhesive categories (Q631567) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- Unfolding semantics of graph transformation (Q879600) (← links)
- Subobject transformation systems (Q934672) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- An algebraic semantics for structured transition systems and its application to logic programs (Q1199528) (← links)
- An abstract machine for concurrent modular systems: CHARM (Q1314422) (← links)
- Compositional SOS and beyond: A coalgebraic view of open systems (Q1603820) (← links)
- On the essence and initiality of conflicts (Q1663985) (← links)
- Equivalence and independence in controlled graph-rewriting processes (Q1663987) (← links)
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches (Q1708174) (← links)
- The PBPO graph transformation approach (Q1734525) (← links)
- A functorial semantics for multi-algebras and partial algebras, with applications to syntax. (Q1853456) (← links)
- Contextual Petri nets, asymmetric event structures, and processes (Q1854468) (← links)
- Domain and event structure semantics for Petri nets with read and inhibitor arcs (Q1882900) (← links)
- An algebraic presentation of term graphs, via gs-monoidal categories (Q1971974) (← links)
- Algebraic graph rewriting with controlled embedding (Q2007726) (← links)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems (Q2011208) (← links)
- Concurrent semantics for fusions: weak prime domains and connected event structures (Q2051794) (← links)
- Rewriting abstract structures: materialization explained categorically (Q2289070) (← links)
- A calculus of concurrent graph-rewriting processes (Q2291821) (← links)
- Unfolding graph grammars with negative application conditions (Q2292971) (← links)
- Estimating costs of multi-component enterprise applications (Q2322308) (← links)
- Specifying graph languages with type graphs (Q2423749) (← links)
- (Q2722031) (← links)
- (Q2736348) (← links)
- A Formal Model for the Deferred Update Replication Technique (Q2830037) (← links)
- (Q2843931) (← links)
- (Q2847775) (← links)
- (Q2847853) (← links)
- (Q2848118) (← links)
- Adaptable Transition Systems (Q2848873) (← links)
- Transformation Systems with Incremental Negative Application Conditions (Q2848878) (← links)
- Unfolding Grammars in Adhesive Categories (Q2888498) (← links)
- An Institution for Graph Transformation (Q2890329) (← links)
- AGREE – Algebraic Graph Rewriting with Controlled Embedding (Q2947209) (← links)
- On GS-Monoidal Theories for Graphs with Nesting (Q3059707) (← links)
- Graph Transformation with Dependencies for the Specification of Interactive Systems (Q3184727) (← links)
- Parallelism in AGREE Transformations (Q3187802) (← links)
- Canonical Derivations with Negative Application Conditions (Q3192238) (← links)
- (Q3355243) (← links)
- Ugo Montanari and Graph Transformation (Q3507353) (← links)
- Unfolding Graph Transformation Systems: Theory and Applications to Verification (Q3507354) (← links)
- Open Petri Nets: Non-deterministic Processes and Compositionality (Q3540404) (← links)
- Sesqui-Pushout Rewriting (Q3541945) (← links)
- Graph Transactions as Processes (Q3541960) (← links)
- A Temporal Graph Logic for Verification of Graph Transformation Systems (Q3591071) (← links)
- McMillan’s Complete Prefix for Contextual Nets (Q3599219) (← links)
- (Q3839055) (← links)