A basic algebra of stateless connectors

DOI10.1016/J.TCS.2006.07.005zbMath1153.68331OpenAlexW2135173989MaRDI QIDQ860881

Ugo Montanari, Ivan Lanese, Roberto Bruni

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.005

zbMATH Keywords

normal formsynchronizationaxiomatizationconnectors

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items (21)

Interacting Hopf algebras ⋮ Tiles for Reo ⋮ A Normal Form for Stateful Connectors ⋮ A formal algebraic approach for the quantitative modeling of connectors in architectures ⋮ Automated synthesis of application-layer connectors from automata-based specifications ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ A model of context-dependent component connectors ⋮ Unnamed Item ⋮ Expressiveness of component-based frameworks: a study of the expressiveness of BIP ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Behaviour, Interaction and Dynamics ⋮ From Hierarchical BIP to Petri Calculus ⋮ Causal Semantics for the Algebra of Connectors ⋮ The calculus of signal flow diagrams. I: Linear relations on streams. ⋮ Causal semantics for the algebra of connectors ⋮ Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications ⋮ A general framework for architecture composability ⋮ Graphical Conjunctive Queries. ⋮ A Connector Algebra for P/T Nets Interactions ⋮ Refinement for signal flow graphs ⋮ String diagram rewrite theory III: Confluence with and without Frobenius

Uses Software

• Reo
• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicategories of processes
• A calculus of communicating systems
• 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
• Interaction combinators
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Normal forms for algebras of connections.
• Bisimilarity of open terms.
• An algebraic presentation of term graphs, via gs-monoidal categories
• Connector colouring. I: Synchronisation and context dependency
• Network algebra for asynchronous dataflow^∗
• Reo: a channel-based coordination model for component composition
• Generic Programming
• Algebra and Coalgebra in Computer Science
• Recent Trends in Algebraic Development Techniques

This page was built for publication: A basic algebra of stateless connectors