Comparing cospan-spans and tiles via a Hoare-style process calculus

Electronic Notes in Theoretical Computer Science

Volumn 62, Issue , 2002, Pages 157-176

  Gadducci, Fabio ^a   Katis, Piergiulio ^b   Montanari, Ugo ^a   Sabadini, Nicoletta ^b   Walters, Robert F C ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

Concurrent; Cospan span approach; Distributed; Interactive systems; Process algebras; Tile logic

Indexed keywords

ALGEBRA; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; LOGIC PROGRAMMING;

CONCURRENT, DISTRIBUTED AND INTERACTIVE SYSTEM; COSPAN-SPAN APPROACH; PROCESS ALGEBRAS; TILE LOGIC;

FORMAL LOGIC;

EID: 19144363376     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00325-1     Document Type: Conference Paper

References (17)

1. Arnold A. Finite transition systems. 1994;Prentice Hall
2. Bloom S., Ésik Z. Iteration Theories. EATCS Monographs on Theoretical Computer Science. 1993;Springer
3. R. Bruni, D. de Frutos-Escrig, N. Martí-Oliet, and U. Montanari. Bisimilarity congruences for open terms and term graphs via tile logic. In C. Palamidessi, editor, Concurrency Theory, volume 1877 of Lect. Notes in Comp. Science, pages 259-274. Springer, 2000.
4. Bruni R., Gadducci F., Montanari U. Normal forms for algebras of connections. Theoret. Comput. Sci. 2002;. To appear. Available at http://www.di.unipi.it/~ugo/tiles.html.
5. R. Bruni, J. Meseguer, and U. Montanari. Executable tile specifications for process calculi. In J. Finance-P., editor, Fundamental Approaches to Software Engineering, volume 1577 of Lect. Notes in Comp. Science, pages 60-76. Springer, 1999.
6. Bruni R., Montanari U. Cartesian closed double categories, their lambda notation, and the pi-calculus. Logic in Computer Science. 1999;246-265 IEEE Computer Society Press
7. Bruni R., Montanari U., Rossi F. An interactive semantics of logic programming. Theory and Practice of Logic Programming. 2001
8. R. Bruni, U. Montanari, and V. Sassone. Open ended systems, dynamic bisimulation and tile logic. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. D. Mosses, and T. Ito, editors, IFIP Theoretical Computer Science, volume 1872 of Lect. Notes in Comp. Science, pages 440-456. Springer, 2000.
9. Ferrari G., Montanari U. Tile formats for located and mobile systems. Information and Computation. 156:2000;173-235
10. Gadducci F., Montanari U. The tile model. Plotkin G., Stirling C., Tofte M. Proof, Language and Interaction: Essays in Honour of Robin Milner. 2000;MIT Press
11. Gadducci F., Montanari U. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoret. Comput. Sci. 2002;. To appear. Available at http://www.di.unipi.it/~ugo/tiles.html.
12. Katis P., Sabadini N., Walters R.F.C. Bicategories of processes. Journal of Pure and Applied Algebra. 115:1997;141-178
13. P. Katis, N. Sabadini, and R.F.C. Walters. SPAN(Graph): A categorical algebra of transition systems. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of Lect. Notes in Comp. Science, pages 307-321. Springer, 1997.
14. P. Katis, N. Sabadini, and R.F.C. Walters. A formalization of the IWIM model. In A. Porto and G.-C. Roman, editors, Coordination, volume 1906 of Lect. Notes in Comp. Science, pages 267-283. Springer, 2000.
15. Katis P., Sabadini N., Walters R.F.C. Recursion and concurrency. Labella A. Fixed Points in Computer Science. 2001
16. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96:1992;73-155
17. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.