Saturated semantics for reactive systems

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 69-78

  Bonchi, Filippo ^a   König, Barbara ^b   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LABELLED TRANSITION SYSTEMS (LTS); REACTIVE SYSTEMS; TRACE EQUIVALENCE; TRANSITION RULES;

COMPUTATIONAL METHODS; LOGIC PROGRAMMING; SET THEORY; TEMPORAL LOGIC;

SEMANTICS;

EID: 34547362238     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.46     Document Type: Conference Paper

References (21)

1. R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous pi-calculus. In Proc. of CONCUR'96, volume 1119 of LNCS, 147-162. Springer, 1996.
2. P. Baldan, A. Bracciali, and R. Bruni. Bisimulation by unification. In AMAST, volume 2422 of LNCS, 254-270. Springer, 2002.
3. G. Berry and G. Boudol. The chemical abstract machine. Theor. Comput. Sci., 96:217-248, 1992.
4. R. Bruni, F. Gadducci, U. Montanari, and P. Sobocinski. Deriving weak bisimulation congruences from reduction systems. In Proc. of CONCUR'05, volume 3653 of LNCS, 293-307. Springer, 2005.
5. R. Bruni, U. Montanari, and F. Rossi. An interactive semantics of logic programming. TPLP, 1(6):647-690, 2001.
6. H. Ehrig and B. König. Deriving bisimulation congruences in the DPO approach to graph rewriting. In Proc. of FoS-SaCS'05, volume 2987 of LNCS, 151-166. Springer, 2004.
7. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. 69(3):289-318, 1989.
8. G. Ferrari, U. Montanari, and E. Tuosto. Model checking for nominal calculi. In Proc. of FoSSaCS'05, volume 3441 of LNCS, 1-24. Springer, 2005.
9. J. Goguen. What is unification? A categorical view of substitution, equation and solution. In M. Nivat and H. Aït-Kaci, editors, Resolution of Equations in Algebraic Structures, 217-261. 1989.
10. B. Klin, V Sassone, and P. Sobocinski. Labels from reductions: Towards a general theory. In Proc. of CALCO'05, volume 3629 of LNCS, 30-50. Springer, 2005.
11. F. Lawvere. Some algebraic problems in the context of functorial semantics of algebraic theories. In Proceedings of the Midwest Category Seminar II, volume 61, 41-61, 1968.
12. J. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR'00, volume 1877 of LNCS, 243-258. Springer, 2000.
13. R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
14. R. Milner. Bigraphical reactive systems. In Proc. of CONCUR'01, volume 2154 of LNCS, 16-35. Springer, 2001.
15. R. Milner and D. Sangiorgi. Barbed bisimulation. In Proc. of ICALP'92, volume 623 of LNCS, 685-695. Springer, 1992.
16. U. Montanari and V Sassone. Dynamic congruence vs. progressing bisimulation for ccs. Fundam. Inform., 16(1):171-199, 1992.
17. D. Sangiorgi. A theory of bisimulation for the pi-calculus. Acta Inf., 33(1):69-97, 1996.
18. V Sassone and P. Sobocinski. Locating reaction with 2-categories. Theor. Comput. Sci., 333(1-2):297-327, 2005.
19. V Sassone and P. Sobocinski. Reactive systems over cospans. In Proc. of LICS'05, 311-320. IEEE, 2005.
20. P. Sewell. From rewrite to bisimulation congruences. In Proc. of CONCUR'98, volume 1466 of LNCS, 269-284. Springer, 1998.
21. P. Sobociński. Deriving process congruences from reaction rules. PhD thesis, 2004.