A basic algebra of stateless connectors

Theoretical Computer Science

Volumn 366, Issue 1-2, 2006, Pages 98-120

  Bruni, Roberto ^a   Lanese, Ivan ^b   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Axiomatization; Connectors; Normal form; Synchronization

Indexed keywords

ABSTRACTING; COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC CONNECTORS; MATHEMATICAL MODELS; SEMANTICS; SYNCHRONIZATION;

AXIOMATIZATION; NORMAL FORM; STATELESS CONNECTORS;

ALGEBRA;

EID: 33750309722     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.07.005     Document Type: Article

References (32)

1. Arbab F. Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14 3 (2004) 1-38
2. F. Arbab, J. Rutten, A coinductive calculus of component connectors, in: Proc. of WADT'02, Lecture Notes in Computer Science, Vol. 2755, Springer, Berlin, 2003, pp. 35-56.
3. Bergstra J.A., Middelburg C.A., and Stefanescu G. Network algebra for asynchronous dataflow. Internat. J. Comput. Math. 65 (1997) 57-88
4. Bruni R., Fiadeiro J.L., Lanese I., Lopes A., and Montanari U. New insights on architectural connectors. Proc. of IFIP TCS 2004 (2004), Kluwer, Dordrecht 367-379
5. R. Bruni, F. Gadducci, U. Montanari, Normal forms for partitions and relations, in: Proc. of WADT'98, Lecture Notes in Computer Science, Vol. 1589, Springer, Berlin, 1999, pp. 31-47.
6. Bruni R., Gadducci F., and Montanari U. Normal forms for algebras of connections. Theoret. Comput. Sci. 286 2 (2002) 247-292 Full version of [5]
7. R. Bruni, I. Lanese, U. Montanari, Complete axioms for stateless connectors, in: Proc. of CALCO'05, Lecture Notes in Computer Science, Vol. 3629, Springer, Berlin, 2005, pp. 98-113.
8. Cazanescu V.E., and Stefanescu G. Towards a new algebraic foundation of flowchart scheme theory. Fund. Inform. 13 (1990) 171-210
9. Chandy K., and Misra J. Parallel Program Design (1988), Addison-Wesley, Reading, MA
10. D. Clarke, D. Costa, F. Arbab, Connector colouring I: synchronization and context dependency, in: Proc. of FOCLASA'05, Electr. Notes Theor. Comput. Sci. 154 (1) (2006) 101-119.
11. Corradini A., and Gadducci F. An algebraic presentation of term graphs, via gs-monoidal categories. Appl. Categorical Struct. 7 (1999) 299-331
12. Corradini A., and Montanari U. An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci. 103 (1992) 51-106
13. Degano P., and Montanari U. A model for distributed systems based on graph rewriting. J. ACM 34 2 (1987) 411-449
14. H. Ehrig, M. Pfender, H.J. Schneider, Graph grammars: an algebraic approach, in: Proc. IEEE Conf. on Automata and Switching Theory, 1973, pp. 167-180.
15. Fiadeiro J.L. Categories for Software Engineering (2004), Springer, Berlin
16. Fiadeiro J.L., Lopes A., and Wermelinger M. A mathematical semantics for architectural connectors. Generic Programming, Lecture Notes in Computer Science Vol. 2793 (2003), Springer, Berlin 190-234
17. Fiadeiro J.L., and Maibaum T. Categorical semantics of parallel program design. Sci. Comput. Programming 28 (1997) 111-138
18. Gadducci F., and Montanari U. The tile model. Proof, Language and Interaction: Essays in Honour of Robin Milner (2000), MIT Press, Cambridge 133-166
19. Gadducci F., and Montanari U. Comparing logics for rewriting: rewriting logic action calculi and tile logic. Theoret. Comput. Sci. 285 2 (2002) 319-358
20. J. A. Goguen, Categorical foundations for general systems theory, in: Advances in Cybernetics and Systems Research, Transcripta Books, 1973, pp. 121-130.
21. Hoare C.A.R. CSP-Communicating Sequential Processes, International Series in Computer Science (1985), Prentice-Hall, Englewood Cliffs, NJ
22. Katis P., Sabadini N., and Walters R.F.C. Bicategories of processes. J. Pure and Appl. Algebra 115 (1997) 141-178
23. Lafont Y. Interaction combinators. Inform. and Comput. 137 1 (1997) 69-101
24. K.G. Larsen, L. Xinxin, Compositionality through an operational semantics of contexts, in: Proc. of ICALP'90, Lecture Notes in Computer Science, Vol. 443, Springer, Berlin, 1990, pp. 526-539.
25. MacLane S. Categories for the Working Mathematician (1971), Springer, Berlin
26. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96 (1992) 73-155
27. Milner R. A Calculus of Communicating Systems. Lecture Notes in Computer Science Vol. 92 (1989), Springer, Berlin
28. R. Milner, Turing, computation and communication, Turing anniversary lecture, October 1997. 〈http://www.fairdene.com/picalculus/milner-infomatics.pdf〉.
29. R. Milner, Bigraphical reactive systems, in: Proc. of CONCUR 2001, Lecture Notes in Computer Science, Vol. 2154, Springer, Berlin, 2001, pp. 16-35.
30. M.R. Mousavi, M. Sirjani, F. Arbab, Formal semantics and analysis of component connectors in Reo, in: Proc. of FOCLASA'05, Electr. Notes Theor. Comput. Sci. 154 (1) (2006) 83-99.
31. Rensink A. Bisimilarity of open terms. Inform. and Comput. 156 1/2 (2000) 345-385
32. Stefanescu G. Network Algebra, Discrete Mathematics and Theoretical Computer Science (2000), Springer, Berlin