The following pages link to Fabio Gadducci (Q344544):
Displaying 50 items.
- A Net-based Approach to Web Services Publication and Replaceability (Q3647365) (← links)
- (Q3839056) (← links)
- (Q3839071) (← links)
- (Q4219030) (← links)
- (Q4222848) (← links)
- (Q4362962) (← links)
- (Q4499230) (← links)
- (Q4502817) (← links)
- (Q4553276) (← links)
- (Q4621140) (← links)
- Rewriting modulo symmetric monoidal structure (Q4635934) (← links)
- A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST (Q4917051) (← links)
- Categorical rewriting of term-like structures (Q4923533) (← links)
- Saturated LTSs for Adhesive Rewriting Systems (Q4931308) (← links)
- Counterpart Semantics for a Second-Order μ-Calculus (Q4931321) (← links)
- (Q4941924) (← links)
- (Q4941927) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- Relating two categorical models of term rewriting (Q5055833) (← links)
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure (Q5058366) (← links)
- String Diagram Rewrite Theory I: Rewriting with Frobenius Structure (Q5066951) (← links)
- CPO models for infinite term rewriting (Q5096397) (← links)
- (Q5144682) (← links)
- Rewriting with Frobenius (Q5145289) (← links)
- (Q5150130) (← links)
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs (Q5170278) (← links)
- Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) (Q5170667) (← links)
- A White Box Perspective on Behavioural Adaptation (Q5256369) (← links)
- Graph rewriting for the π-calculus (Q5308095) (← links)
- Towards a Notion of Transaction in Graph Rewriting (Q5404174) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431314) (← links)
- Global Computing (Q5464838) (← links)
- A Soft Approach to Multi-objective Optimization (Q5504696) (← links)
- Petri Nets Are Dioids (Q5505415) (← links)
- Formal Methods in Software and Systems Modeling (Q5710425) (← links)
- RPO semantics for mobile ambients (Q5740373) (← links)
- Concurrency cannot be observed, asynchronously (Q5740646) (← links)
- Concurrent Rewriting for Graphs with Equivalences (Q5756599) (← links)
- (Q5875678) (← links)
- String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897490) (← links)
- Processes, Terms and Cycles: Steps on the Road to Infinity (Q5898154) (← links)
- Programming Languages and Systems (Q5902355) (← links)
- Perspectives of System Informatics (Q5902418) (← links)
- Soft constraint automata with memory (Q5918138) (← links)
- Soft constraint automata with memory (Q5918271) (← links)
- Specification and modelling of computing systems through graphs and graph transformation (Q6052952) (← links)
- (Q6061682) (← links)
- From gs-monoidal to oplax cartesian categories: constructions and functorial completeness (Q6077384) (← links)
- A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity (Q6199404) (← links)
