Abstract
We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ehrig, H., König, B.: Deriving bisimulation congruences in the DPO approach to graph re writing. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 151–166. Springer, Heidelberg (2004)
Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133–166. MIT Press, Cambridge (2000)
Jensen, O.H., Milner, R.: Bigraphs and mobile processes. Technical Report 570, University of Cambridge (2003)
Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)
Mac Lane, S.: Categorical algebra. Bulletin of the American Mathematical Society 71, 40–106 (1965)
Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Graduate Texts in Mathematics. Springer, Heidelberg (1992)
Milner, R.: Calculi for interaction. Acta Informatica 33(8), 707–737 (1996)
Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 16–35. Springer, Heidelberg (2001)
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)
Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department (1981)
Sassone, V., Sobociński, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing 10(2), 163–183 (2003)
Sassone, V., Sobociński, P.: A congruence for Petri nets. In: Workshop on Petri Nets and Graph Transformation. ENTCS, vol. 127, pp. 107–120 (2005)
Sassone, V., Sobociński, P.: Locating reaction with 2-categories. Theoretical Computer Science 333(1-2), 297–327 (2005)
Sassone, V., Sobociński, P.: Reactive systems over cospans. In: Proceedings of Logics in Computer Science. LICS 2005. IEEE Press, Los Alamitos (2005)
Sewell, P.: Working notes PS15–PS19, Unpublished notes (2000)
Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science 274(1–2), 183–230 (2002)
Sobociński, P.: Deriving process congruences from reaction rules. PhD thesis, BRICS, University of Aarhus (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klin, B., Sassone, V., Sobociński, P. (2005). Labels from Reductions: Towards a General Theory. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds) Algebra and Coalgebra in Computer Science. CALCO 2005. Lecture Notes in Computer Science, vol 3629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548133_2
Download citation
DOI: https://doi.org/10.1007/11548133_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28620-2
Online ISBN: 978-3-540-31876-7
eBook Packages: Computer ScienceComputer Science (R0)