Abstract
We investigate Leifer and Milner RPO approach for deriving efficient (finitely branching) LTS’s and bisimilarities for π-calculus. To this aim, we work in a category of second-order term contexts and we apply a general pruning technique, which allows to simplify the set of transitions in the LTS obtained from the original RPO approach. The resulting LTS and bisimilarity provide an alternative presentation of symbolic LTS and Sangiorgi’s open bisimilarity.
Work partially supported by PRIN Project SISTER 20088HXMYN and FIRB Project RBIN04M8S8, both funded by MIUR.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Sassone, V., Sobocinski, P.: Deriving bisimulation congruences using 2-categories. Nord. J. Comput. 10, 163–190 (2003)
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)
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)
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)
Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: LICS, pp. 69–80. IEEE Computer Society, Los Alamitos (2006)
Di Gianantonio, P., Honsell, F., Lenisa, M.: Finitely branching labelled transition systems from reaction semantics for process calculi. In: WADT. LNCS, vol. 5486, pp. 119–134. Springer, Heidelberg (2009)
Bonchi, F., Gadducci, F., Monreale, G.V.: Reactive systems, barbed semantics, and the mobile ambients. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 272–287. Springer, Heidelberg (2009)
Di Gianantonio, P., Honsell, F., Lenisa, M.: RPO, second-order contexts, and lambda-calculus. Logical Methods in Computer Science 5 (2009)
Jensen, O.H., Milner, R.: Bigraphs and transitions. In: POPL, pp. 38–49 (2003)
Sobocinski, P.: A well-behaved lts for the pi-calculus (abstract). Electr. Notes Theor. Comput. Sci. 192, 5–11 (2007)
Di Gianantonio, P., Jaksic, S., Lenisa, M.: Efficient bisimilarities from second-order reaction semantics for pi-calculus. Technical report, Università di Udine (2010), http://sole.dimi.uniud.it/~marina.lenisa/Papers/Soft-copy-pdf/tr10.pdf
Parrow, J.: An introduction to the pi-calculus. In: Bergstra, Ponse, Smolka (eds.) Handbook of Process Algebra, pp. 479–543. Elsevier, Amsterdam (2001)
Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Inf. 33, 69–97 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gianantonio, P., Jakšić, S., Lenisa, M. (2010). Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)