Coalgebraic models for reactive systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4703 LNCS, Issue , 2007, Pages 364-379

  Bonchi, Filippo ^a   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; LOGIC PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL ANALYSIS;

BISIMILARITY RELATION; NORMALIZED COALGEBRAS; REACTIVE SYSTEMS;

SEMANTICS;

EID: 38149016830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74407-8_25     Document Type: Conference Paper

References (19)

1. Adámek, J., Koubek, V: On the greatest fixed point of a set functor. Theoretical Computer Science 150(1) (1995)
2. Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processes. Mathematical Structures in Computer Science 15(1), 1-35 (2005)
3. Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Computer Science 96, 217-248 (1992)
4. Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS, pp. 69-80. IEEE Computer Society Press, Los Alamitos (2006)
5. Bonchi, F., Montanari, U.: A coalgebraic theory of reactive systems. Electronic Notes in Theoretical Computer Science, LIX Colloqium on Emerging Trends in Concurrency Theory (to appear)
6. Corradini, A., Große-Rhode, M., Heckel, R.: A coalgebraic presentation of structured transition systems. Theoretical Computer Science 260, 27-55 (2001)
7. Corradini, A., Heckel, R., Montanari, U.: From sos specifications to structured coalgebras: How to make bisimulation a congruence. Electronic Notes in Theoretical Computer Science, vol. 19 (1999)
8. Ehrig, H., König, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 151-166. Springer, Heidelberg (2005)
9. Kanellakis, P.C., Smolka, S.A.: Ces expressions, finite state processes, and three problems of equivalence. Information and Computation 86(1), 43-68 (1990)
10. Kindler, E.: A compositional partial order semantics for Petri net components. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 235-252. Springer, Heidelberg (1997)
11. Klin, B., Sassone, V., Sobocinski, P.: Labels from reductions: Towards a general theory. In: Fiadeira, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 30-50. Springer, Heidelberg (2005)
12. Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243-258. Springer, Heidelberg (2000)
13. Milner, R.: Bigraphs for Petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 686-701. Springer, Heidelberg (2004)
14. Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 16-35. Springer, Heidelberg (2001)
15. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3-80 (2000)
16. Sassone, V., Sobociński, P.: A congruence for Petri nets. In: Ehrig, H., Padberg, J., Rozenberg, G. (eds.) Petri Nets and Graph Transformation. ENTCS, vol. 127, pp. 107-120. Elsevier, Amsterdam (2005)
17. Sassone, V., Sobocinski, P.: Reactive systems over cospans. In: Proc. of LICS, pp. 311-320. IEEE Computer Society Press, Los Alamitos (2005)
18. Sobociński, P.: Deriving process congruences from reaction rules. PhD thesis (2004)
19. Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: Proc. of LICS, pp. 280-291. IEEE Computer Society Press, Los Alamitos (1997)