Traces, Executions and Schedulers, Coalgebraically

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.

[1]  Ichiro Hasuo,et al.  Tracing Anonymity with Coalgebras , 2008 .

[2]  Sam Lindley,et al.  Extensional Rewriting with Sums , 2007, TLCA.

[3]  A. Joyal.  Foncteurs analytiques et espèces de structures , 1986 .

[4]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[5]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[6]  Ling Cheung,et al.  Reconciling nondeterministic and probabilistic choices , 2006 .

[7]  Roberto Segala,et al.  A Compositional Trace-Based Semantics for Probabilistic Automata , 1995, CONCUR.

[8]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[9]  Insup Lee,et al.  CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.

[10]  Ichiro Hasuo,et al.  Generic Forward and Backward Simulations , 2006, CONCUR.

[11]  Thorsten Altenkirch,et al.  Derivatives of Containers , 2003, TLCA.

[12]  S. Lack,et al.  Introduction to extensive and distributive categories , 1993 .

[13]  Sachin Lodha,et al.  Probabilistic Anonymity , 2007, PinKDD.

[14]  Bart Jacobs.  Trace Semantics for Coalgebras , 2004, CMCS.

[15]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

[16]  Alexander Kurz,et al.  Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings , 2009, CALCO.

[17]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[18]  Ana Sokolova,et al.  The Microcosm Principle and Concurrency in Coalgebra , 2008, FoSSaCS.

[19]  Glynn Winskel,et al.  Distributing probability over non-determinism , 2006, Mathematical Structures in Computer Science.

[20]  Catuscia Palamidessi,et al.  Making Random Choices Invisible to the Scheduler , 2007, CONCUR.

[21]  Vincent Danos,et al.  Transactions in RCCS , 2005, CONCUR.

[22]  Ichiro Hasuo,et al.  Context-Free Languages via Coalgebraic Trace Semantics , 2005, CALCO.

[23]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .