Notions of computation and monads
Information and Computation
Journal of the ACM (JACM)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Exercises in Coalgebraic Specification
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Processes as formal power series: a coinductive approach to denotational semantics
Theoretical Computer Science
On the Unification of Process Semantics: Observational Semantics
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
(Bi)simulations up-to characterise process semantics
Information and Computation
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
The microcosm principle and concurrency in coalgebra
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Traces, executions and schedulers, coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Structural Operational Semantics and Modal Logic, Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking linear coalgebraic temporal logics: an automata-theoretic approach
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Towards Effects in Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Context-free languages via coalgebraic trace semantics
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
The least fibred lifting and the expressivity of coalgebraic modal logic
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Testing semantics: connecting processes and process logics
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Towards bialgebraic semantics for the linear time --- branching time spectrum
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Traditionally, traces are the sequences of labels associated with paths in transition systems X-P(AxX). Here we describe traces more generally, for coalgebras of the form X-P(F(X)), where F is a polynomial functor. The main result states that F's final coalgebra Z-@?F(Z) gives rise to a weakly final coalgebra with state space P(Z), in a suitable category of coalgebras. Weak finality means that there is a coalgebra map X-P(Z), but there is no uniqueness. We show that there is a canonical choice among these maps X-P(Z), namely the largest one, describing the traces in a suitably abstract formulation. A crucial technical ingredient in our construction is a general distributive law FP@?PF, obtained via relation lifting.