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

The large diffusion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy specification of such systems. The aim of our note is to compare two recent formalisms for the design of concurrent and distributed systems, namely the tile logic and the cospan-span model. We first present a simple, yet rather expressive Hoare-style process algebra; then, after presenting the basics of both approaches, we compare them via their modeling of the calculus.

[1]  Roberto Bruni,et al.  Normal forms for algebras of connection , 2002, Theor. Comput. Sci..

[2]  Roberto Bruni,et al.  Executable Tile Specifications for Process Calculi , 1999, FASE.

[3]  Nicoletta Sabadini,et al.  Span(Graph): A Categorial Algebra of Transition Systems , 1997, AMAST.

[4]  Roberto Bruni,et al.  Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic , 2000, CONCUR.

[5]  André Arnold,et al.  Finite transition systems , 1994 .

[6]  Roberto Bruni,et al.  Open Ended Systems, Dynamic Bisimulation and Tile Logic , 2000, IFIP TCS.

[7]  Nicoletta Sabadini,et al.  A Formalization of the IWIM Model , 2000, COORDINATION.

[8]  Fabio Gadducci,et al.  Comparing logics for rewriting: rewriting logic, action calculi and tile logic , 2002, Theor. Comput. Sci..

[9]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[10]  Fabio Gadducci,et al.  The tile model , 2000, Proof, Language, and Interaction.

[11]  Gian Luigi Ferrari,et al.  Tile Formats for Located and Mobile Systems , 2000, Inf. Comput..

[12]  Roberto Bruni,et al.  Cartesian closed double categories, their lambda-notation, and the pi-calculus , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[13]  Roberto Bruni,et al.  An interactive semantics of logic programming , 2001, Theory and Practice of Logic Programming.

[14]  Zoltán Ésik,et al.  Iteration Theories , 1993, EATCS Monographs on Theoretical Computer Science.

[15]  Nicoletta Sabadini,et al.  Bicategories of processes , 1997 .

[16]  G. Plotkin,et al.  Proof, language, and interaction: essays in honour of Robin Milner , 2000 .