A basic algebra of stateless connectors
- 1 November 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 366 (1-2) , 98-120
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Complete Axioms for Stateless ConnectorsLecture Notes in Computer Science, 2005
- Reo: a channel-based coordination model for component compositionMathematical Structures in Computer Science, 2004
- A Coinductive Calculus of Component Connectors2003
- Normal forms for algebras of connectionsTheoretical Computer Science, 2002
- An Algebraic Presentation of Term Graphs, via GS-Monoidal CategoriesApplied Categorical Structures, 1999
- Normal Forms for Partitions and Relations1999
- Network algebra for asynchronous dataflow∗International Journal of Computer Mathematics, 1997
- An algebraic semantics for structured transition systems and its application to logic programsTheoretical Computer Science, 1992
- A model for distributed systems based on graph rewritingJournal of the ACM, 1987
- Graph-grammars: An algebraic approach1973