The following pages link to Roberto Bruni (Q860880):
Displayed 39 items.
- (Q4449180) (← links)
- An interactive semantics of logic programming (Q4452646) (← links)
- (Q4484496) (← links)
- (Q4499237) (← links)
- (Q4536441) (← links)
- (Q4536607) (← links)
- (Q4553276) (← links)
- (Q4621140) (← links)
- (Q4621156) (← links)
- A Flat Process Calculus for Nested Membrane Interactions (Q4621177) (← links)
- (Q4673419) (← links)
- (Q4673433) (← links)
- Concurrent models for Linda with transactions (Q4819117) (← links)
- (Q4941924) (← links)
- Algebras for Tree Decomposable Graphs (Q5100734) (← links)
- Concurrency and Probability (Q5145292) (← links)
- On Symbolic Semantics for Name-decorated Contexts (Q5166612) (← links)
- From Hierarchical BIP to Petri Calculus (Q5170743) (← links)
- Hierarchical Design Rewriting with Maude (Q5179129) (← links)
- (Q5207054) (← links)
- A White Box Perspective on Behavioural Adaptation (Q5256369) (← links)
- On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs (Q5259267) (← links)
- Theoretical foundations for compensations in flow composition languages (Q5276147) (← links)
- Behaviour, Interaction and Dynamics (Q5403078) (← links)
- Modelling Dynamic Software Architectures using Typed Graph Grammars (Q5403458) (← links)
- Deducing Interactions in Partially Unspecified Biological Systems (Q5429371) (← links)
- Global Computing (Q5464831) (← links)
- Algebra and Coalgebra in Computer Science (Q5492816) (← links)
- Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines (Q5505419) (← links)
- Lectures on Concurrency and Petri Nets (Q5712298) (← links)
- cJoin: Join with communicating transactions (Q5740633) (← links)
- CaSPiS: a calculus of sessions, pipelines and services (Q5740635) (← links)
- Event Structure Semantics for Nominal Calculi (Q5756598) (← links)
- Theoretical Computer Science (Q5897365) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897490) (← links)
- Recent Trends in Algebraic Development Techniques (Q5900820) (← links)
- Limits and difficulties in the design of under-approximation abstract domains (Q6141757) (← links)
- Deciding program properties via complete abstractions on bounded domains (Q6164426) (← links)
- Data-driven choreographies à la Klaim (Q6199106) (← links)