Finitely branching labelled transition systems from reaction semantics for process calculi

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

Volumn 5486 LNCS, Issue , 2009, Pages 119-134

  Di Gianantonio, Pietro ^a   Honsell, Furio ^a   Lenisa, Marina ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

LABELLED TRANSITION SYSTEMS; NEW SOLUTIONS; PROCESS CALCULI;

BIOMINERALIZATION;

ALGEBRA;

EID: 70349306611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03429-9_9     Document Type: Conference Paper

References (10)

1. 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)
2. Bonchi, F., Gadducci, F., König, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U.,Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 168-183. Springer, Heidelberg (2006)
3. Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: LICS, pp. 69-80. IEEE Computer Society, Los Alamitos (2006)
4. Ferrari, G.L., Montanari, U., Tuosto, E.: Model checking for nominal calculi. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 1-24. Springer, Heidelberg (2005)
5. Gadducci, F., Montanari, U.: Observing reductions in nominal calculi via a graphical encoding of processes. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 106-126. Springer, Heidelberg (2005)
6. Sassone, V., Sobocinski, P.: Deriving bisimulation congruences using 2-categories. Nord. J. Comput. 10(2), 163-190 (2003)
7. Di Gianantonio, P., Honsell, F., Lenisa, M.: RPO, second-order contexts, and lambda-calculus. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 334-349. Springer, Heidelberg (2008), http://www.dimi.uniud.it/pietro/papers/
8. Sobocinski, P.: Deriving process congruences from reduction rules. PhD thesis, University of Aarhus (2004)
9. Jensen, O.H., Milner, R.: Bigraphs and transitions. In: POPL, pp. 38-49. ACM, New York (2003)
10. Sobocinski, P.: A well-behaved lts for the pi-calculus (abstract). Electr. Notes Theor. Comput. Sci. 192(1), 5-11 (2007)