The following pages link to Ugo Montanari (Q239557):
Displaying 50 items.
- A survey of constraint-based programming paradigms (Q458465) (← links)
- Network-conscious \(\pi\)-calculus -- a model of Pastry (Q530841) (← links)
- QoS negotiation in service composition (Q615894) (← links)
- Symmetries, local names and dynamic (de)-allocation of names (Q618165) (← links)
- Location equivalence in a parametric setting (Q672708) (← links)
- Process versus unfolding semantics for Place/Transition Petri nets (Q672872) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459) (← links)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves (Q843097) (← links)
- About permutation algebras, (pre)sheaves and named sets (Q853745) (← links)
- A basic algebra of stateless connectors (Q860881) (← links)
- Unfolding semantics of graph transformation (Q879600) (← links)
- A coalgebraic semantics for causality in Petri nets (Q890619) (← links)
- A\(^ 2\)CCS: Atomic actions for CCS (Q912608) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- Petri nets are monoids (Q922720) (← links)
- Concurrent histories: a basis for observing distributed systems (Q1089787) (← links)
- A distributed operational semantics of CCS based on condition/event systems (Q1110338) (← 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)
- Axiomatizing CCS, nets and processes (Q1314538) (← links)
- A \(\pi\)-calculus with explicit substitutions (Q1350998) (← links)
- (Q1380120) (redirect page) (← links)
- Partial order and contextual net semantics for atomic and locally atomic CC programs (Q1380121) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Compositional SOS and beyond: A coalgebraic view of open systems (Q1603820) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- Models of computation (Q1625203) (← links)
- Decomposition structures for soft constraint evaluation problems: an algebraic approach (Q1708188) (← links)
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
- Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)
- Networks of constraints: Fundamental properties and applications to picture processing (Q1844713) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- Zero-safe nets: Comparing the collective and individual token approaches. (Q1854323) (← links)
- Tile formats for located and mobile systems. (Q1854326) (← links)
- Functorial models for Petri nets (Q1854467) (← links)
- Contextual Petri nets, asymmetric event structures, and processes (Q1854468) (← links)
- Axiomatizing the algebra of net computations and processes (Q1901718) (← links)
- Contextual nets (Q1902298) (← links)
- Graph rewriting, constraint solving and tiles for coordinating distributed systems (Q1971975) (← links)
- A network-conscious \(\pi\)-calculus and its coalgebraic semantics (Q2253186) (← links)
- Revisiting causality, coalgebraically (Q2257982) (← links)
- Bayesian network semantics for Petri nets (Q2286739) (← links)
- A compositional coalgebraic model of fusion calculus (Q2373651) (← links)
- Constraint relaxation may be perfect (Q2384384) (← links)
- Heuristically guided search and chromosome matching (Q2542412) (← links)
- Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice (Q2543581) (← links)
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus (Q2566037) (← links)
- Quantitative \(\mu\)-calculus and CTL defined over constraint semirings (Q2576952) (← links)
