The following pages link to Fabio Gadducci (Q344544):
Displaying 50 items.
- Residuation for bipolar preferences in soft constraints (Q344546) (← links)
- A decentralised graphical implementation of mobile ambients (Q624388) (← links)
- About permutation algebras, (pre)sheaves and named sets (Q853745) (← links)
- Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
- A causal semantics for CCS via rewriting logic (Q1606128) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory (Q1713413) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- A functorial semantics for multi-algebras and partial algebras, with applications to syntax. (Q1853456) (← links)
- An algebraic presentation of term graphs, via gs-monoidal categories (Q1971974) (← links)
- Implementation correctness for replicated data types, categorically (Q2037954) (← links)
- Concurrent semantics for fusions: weak prime domains and connected event structures (Q2051794) (← links)
- Residuation for soft constraints: lexicographic orders and approximation techniques (Q2055790) (← links)
- Categorical specification and implementation of replicated data types (Q2072069) (← links)
- A presheaf environment for the explicit fusion calculus (Q2392481) (← links)
- Observational and behavioural equivalences for soft concurrent constraint programming (Q2403819) (← links)
- Processes as formal power series: a coinductive approach to denotational semantics (Q2503337) (← links)
- Distributivity and residuation for lexicographic orders (Q2671819) (← links)
- Comparing cospan-spans and tiles via a Hoare-style process calculus (Q2841276) (← links)
- GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs (Q2842817) (← links)
- Inequational deduction as term graph rewriting (Q2843931) (← links)
- Some characterization results for permutation algebras (Q2847782) (← links)
- On term graphs as an adhesive category (Q2848118) (← links)
- Adaptable Transition Systems (Q2848873) (← links)
- Barbed Semantics for Open Reactive Systems (Q2848882) (← links)
- Graphical verification of a spatial logic for the {\(\pi\)}-calculus (Q2852049) (← links)
- Modelling calculi with name mobility using graphs with equivalences (Q2867900) (← links)
- A calculus for team automata (Q2873606) (← links)
- An Institution for Graph Transformation (Q2890329) (← links)
- Counterpart semantics for a second-order \(\mu\)-calculus (Q2898468) (← links)
- A Modular LTS for Open Reactive Systems (Q2915166) (← links)
- Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models (Q2918971) (← links)
- A General Theory of Barbs, Contexts, and Labels (Q2946747) (← links)
- Confluence of Graph Rewriting with Interfaces (Q2988637) (← links)
- On GS-Monoidal Theories for Graphs with Nesting (Q3059707) (← links)
- Adhesivity Is Not Enough: Local Church-Rosser Revisited (Q3088028) (← links)
- Encoding Asynchronous Interactions Using Open Petri Nets (Q3184668) (← links)
- A Term-Graph Syntax for Algebras over Multisets (Q3184730) (← links)
- Asynchronous Traces and Open Petri Nets (Q3460864) (← links)
- A Category of Explicit Fusions (Q3507388) (← links)
- Ugo Montanari and Friends (Q3507399) (← links)
- A Behavioural Congruence for Web Services (Q3508530) (← links)
- Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study (Q3510856) (← links)
- A Decentralized Implementation of Mobile Ambients (Q3540392) (← links)
- Parallel and Sequential Independence for Borrowed Contexts (Q3540401) (← links)
- Process Bisimulation Via a Graphical Encoding (Q3541958) (← links)
- Graph Transactions as Processes (Q3541960) (← links)
- (Q3601413) (← links)
- Graphical Encoding of a Spatial Logic for the π-Calculus (Q3612492) (← links)
- Reactive Systems, Barbed Semantics, and the Mobile Ambients (Q3617735) (← links)
