Abstract
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from executions, by projecting away states. These traces and executions are sequences and will be called “thin”. The coalgebraic approach gives rise to both “thin” and “fat” traces/executions, where in the “fat” case the structure of computations is preserved. This distinction between thin and fat will be introduced first. It is needed for a theory of schedulers in a coalgebraic setting, of which we only present the very basic definitions and results.
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.
Similar content being viewed by others
References
Abbott, M., Altenkirch, T., Ghani, N., McBride, C.: Derivatives of Containers. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 16–30. Springer, Heidelberg (2003)
Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 171–185. Springer, Heidelberg (2005)
Carboni, A., Lack, S., Walters, R.F.C.: Introduction to extensive and distributive categories. JPAA 84(2), 145–158 (1993)
Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 42–58. Springer, Heidelberg (2007)
Cheung, L.: Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud University Nijmegen (2006)
van Glabbeek, R.J.: The linear time – branching time spectrum (extended abstract). In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 278–297. Springer, Heidelberg (1990)
Hasuo, I.: Generic forward and backward simulations. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 406–420. Springer, Heidelberg (2006)
Hasuo, I.: Tracing Anonymity with Coalgebras. PhD thesis, Radboud University Nijmegen (2008)
Hasuo, I., Jacobs, B.: Context-free languages via coalgebraic trace semantics. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 213–231. Springer, Heidelberg (2005)
Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. LMCS, 3(4:11) (2007)
Hasuo, I., Jacobs, B., Sokolova, A.: The microcosm principle and concurrency in coalgebra. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 246–260. Springer, Heidelberg (2008)
Jacobs, B.: Trace semantics for coalgebras. In: Adámek, J., Milius, S. (eds.) CMCS 2004. ENTCS, vol. 106 (2004)
Joyal, A.: Foncteurs analytiques et espces de structures. In: Labelle, G., Leroux, P. (eds.) Combinatoire Enumerative. LNM, vol. 1234, pp. 126–159. Springer, Berlin (1986)
Segala, R.: A compositional trace-based semantics for probabilistic automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 234–248. Springer, Heidelberg (1995)
Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT (1995)
Varacca, D., Winskel, G.: Distributing probability over non-determinism. MSCS 16, 87–113 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jacobs, B., Sokolova, A. (2009). Traces, Executions and Schedulers, Coalgebraically. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds) Algebra and Coalgebra in Computer Science. CALCO 2009. Lecture Notes in Computer Science, vol 5728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03741-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-03741-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03740-5
Online ISBN: 978-3-642-03741-2
eBook Packages: Computer ScienceComputer Science (R0)