Generic Trace Semantics via Coinduction

68Q45: Formal languages and automata

68Q55: Semantics in the theory of computing

18C50: Categorical semantics of formal languages

18C20: Eilenberg-Moore and Kleisli constructions for monads

Related Items

Unnamed Item, Coinductive predicates and final sequences in a fibration, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A coalgebraic view on reachability, Simplified Coalgebraic Trace Equivalence, Smooth coalgebra: testing vector analysis, Practical coinduction, Initial Algebras of Terms with Binding and Algebraic Structure, Towards Effects in Mathematical Operational Semantics, Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems, Coinductive predicates and final sequences in a fibration, Monads for behaviour, Identifying all preorders on the subdistribution monad, ``Keep definition, change category -- a practical approach to state-based system calculi, Relation lifting, a survey, Semantics of higher-order quantum computation via geometry of interaction, Maximal traces and path-based coalgebraic temporal logics, Bialgebras for structural operational semantics: an introduction, Coalgebraic semantics of modal logics: an overview, Quantitative simulations by matrices, Generic weakest precondition semantics from monads enriched with order, Coalgebraic constructions of canonical nondeterministic automata, Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure, Behavioural equivalences for coalgebras with unobservable moves, Probabilistic anonymity via coalgebraic simulations, Extensional quotient coalgebras, A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata, (in)finite trace equivalence of probabilistic transition systems, Steps and traces, Categorical Büchi and parity conditions via alternating fixed points of functors, Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies, Iterated covariant powerset is not a monad, Combining semilattices and semimodules, Trace semantics via determinization, Relational presheaves, change of base and weak simulation, Merging Hierarchically-Structured Documents in Workflow Systems, Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems, Complete Iterativity for Algebras with Effects, Traces, Executions and Schedulers, Coalgebraically, Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum, Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics, From Coalgebraic to Monoidal Traces, Coalgebraic trace semantics via forgetful logics, Unnamed Item, Coalgebraic Representation Theory of Fractals, Final Semantics for Decorated Traces, Trace-Based Coinductive Operational Semantics for While, A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum