Deriving weak bisimulation congruences from reduction systems

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 293-307

  Bruni, Roberto ^a   Gadducci, Fabio ^a   Montanari, Ugo ^a   Sobociński, Paweł ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EQUIVALENCE CLASSES; FORMAL LOGIC; MATHEMATICAL MODELS; SET THEORY;

ABSTRACT SEMANTICS; BISIMULATION CONGRUENCES; LABELED TRANSITION SYSTEMS (LTS); PROCESS CALCULI;

SEMANTICS;

EID: 27244449501     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_24     Document Type: Conference Paper

References (20)

1. R. Bruni, D. de Frutos-Escrig, N. Martí-Oliet, and U. Montanari. Bisimilarity congruences for open terms and term graphs via tile logic. In Proc. of CONCUR 2000, vol. 1877 of Lect. Notes in Comp. Sci., pp. 259-274. Springer, 2000.
2. R. Bruni, J. Meseguer, and U. Montanari. Symmetric and cartesian double categories as a semantic framework for tile logic. Mathematical Structures in Computer Science, 12:53-90, 2002.
3. R Bruni, U. Montanari, and F. Rossi. An interactive semantics of logic programming. Theory and Practice of Logic Programming, 1:647-690, 2001.
4. R. Bruni, U. Montanari, and V. Sassone. Observational congruences for dynamically reconfigurable tile systems Theor. Comp. Sci., 335(2-3):331-372, 2005.
5. A. Corradini and F. Gadducci. Rewriting on cyclic structures: Equivalence between the operational and the categorical description. Informatique Théorique et Applications/Theoretical Informatics and Applications, 33:467-493, 1999.
6. G. Ferrari and U. Montanari. Tile formats for located and mobile systems. Inform. and Comput., 156:173-235, 2000.
7. F. Gadducci, R. Heckel, and M. Llabrés. A bi-categorical axiomatisation of concurrent graph rewriting. In Proc. of CTCS'99, vol. 29 of Electr. Notes in Theor. Comp. Sci., Elsevier, 1999.
8. F. Gadducci and U. Montanari. The tile model. In Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133-166. MIT Press, 2000.
9. O. H. Jensen. Bigraphs and weak bisimilarity. Talk at Dagstuhl Seminar 04241, June 2004.
10. O. H. Jensen and R. Milner. Bigraphs and mobile processes. Technical Report 570, Computer Laboratory, University of Cambridge, 2003.
11. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR 2000, vol. 1877 of Lect. Notes in Comp. Sci., pp. 243-258. Springer, 2000.
12. P. A. Melliès. Double categories: A modular model of multiplicative linear logic. Mathematical Structures in Computer Science, 12:449-479, 2002.
13. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theor. Comp. Sci., 96:73-155, 1992.
14. R. Milner. The polyadic π-calculus: A tutorial. In Logic and Algebra of Specification, vol. 94 of Nato ASI Series F, pp. 203-246. Springer, 1993.
15. P.H. Palmquist. The double category of adjoint squares. In Midwest Category Seminar, vol. 195 of Lectures Notes in Mathematics, pp. 123-153. Springer, 1971.
16. A.J. Power. An abstract formulation for rewrite systems. In Category Theory and Computer Science, vol. 389 of Lect. Notes in Comp. Sci., pp. 300-312. Springer, 1989.
17. D.E. Rydehard and E.G. Stell. Foundations of equational deductions: A categorical treatment of equational proofs and unification algorithms. In Category Theory and Computer Science, vol. 283 of Lect. Notes in Comp. Sci., pp. 114-139. Springer, 1987.
18. V. Sassone and P. Sobociński. Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing, 10:163-183, 2003.
19. P. Sewell. From rewrite rules to bisimulation congruences. Theor. Comp. Sci., 274:183-230, 2004.
20. R.H. Street. Categorical structures. Handbook of Algebra, vol. 1, pp. 529-577. North-Holland, 1996.