A Connector Algebra for P/T Nets Interactions
From MaRDI portal
Publication:3090838
DOI10.1007/978-3-642-23217-6_21zbMath1344.68161OpenAlexW154180254MaRDI QIDQ3090838
Roberto Bruni, Ugo Montanari, Hernán Melgratti
Publication date: 2 September 2011
Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_21
Related Items
Step semantics of Boolean nets, A Normal Form for Stateful Connectors, Unnamed Item, Confluence of Graph Rewriting with Interfaces, Open Petri nets, Behaviour, Interaction and Dynamics, The algebra of partial equivalence relations, A Programming Language for Spatial Distribution of Net Systems, From Hierarchical BIP to Petri Calculus, Lawvere Categories as Composed PROPs, Relational presheaves, change of base and weak simulation, String diagram rewrite theory III: Confluence with and without Frobenius
Uses Software
Cites Work
- Unnamed Item
- A basic algebra of stateless connectors
- Conditional rewriting logic as a unified model of concurrency
- An algebraic semantics for structured transition systems and its application to logic programs
- Categorical semantics of parallel program design
- Dynamic connectors for concurrency
- Normal forms for algebras of connections.
- Tile formats for located and mobile systems.
- The origins of structural operational semantics
- Graph rewriting, constraint solving and tiles for coordinating distributed systems
- Tiles for Reo
- Representations of Petri Net Interactions
- Reaction and control I. Mixing additive and multiplicative network algebras
- An interactive semantics of logic programming
- Compositional semantics for open Petri nets based on deterministic processes
- Reo: a channel-based coordination model for component composition
- Theoretical Aspects of Computing - ICTAC 2004
- Causal semantics for the algebra of connectors
