Generic Trace Semantics via Coinduction
From MaRDI portal
Publication:5453504
DOI10.2168/LMCS-3(4:11)2007zbMath1131.68058MaRDI QIDQ5453504
Bart Jacobs, Ichiro Hasuo, Ana Sokolova
Publication date: 1 April 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Eilenberg-Moore and Kleisli constructions for monads (18C20)
Related Items (62)
Coinductive predicates and final sequences in a fibration ⋮ Monads for behaviour ⋮ Stream processors and comodels ⋮ Coalgebras for Bisimulation of Weighted Automata over Semirings ⋮ Complete Iterativity for Algebras with Effects ⋮ Traces, Executions and Schedulers, Coalgebraically ⋮ Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum ⋮ Identifying all preorders on the subdistribution monad ⋮ Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ Iterated covariant powerset is not a monad ⋮ ``Keep definition, change category -- a practical approach to state-based system calculi ⋮ Relation lifting, a survey ⋮ 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 ⋮ Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics ⋮ From Coalgebraic to Monoidal Traces ⋮ Semantics of higher-order quantum computation via geometry of interaction ⋮ Unnamed Item ⋮ 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 ⋮ Runners for interleaving algebraic effects ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Smooth coalgebra: testing vector analysis ⋮ Practical coinduction ⋮ Unnamed Item ⋮ Maximal traces and path-based coalgebraic temporal logics ⋮ Bialgebras for structural operational semantics: an introduction ⋮ Coalgebraic semantics of modal logics: an overview ⋮ Coalgebraic trace semantics via forgetful logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Combining semilattices and semimodules ⋮ Extensional quotient coalgebras ⋮ Unnamed Item ⋮ 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 ⋮ Probabilistic anonymity via coalgebraic simulations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantitative simulations by matrices ⋮ 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 ⋮ Unnamed Item ⋮ A coalgebraic view on reachability ⋮ Coinductive predicates and final sequences in a fibration ⋮ Unnamed Item ⋮ Simplified Coalgebraic Trace Equivalence ⋮ Trace semantics via determinization ⋮ Relational presheaves, change of base and weak simulation ⋮ Unnamed Item ⋮ Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic ⋮ Coalgebraic semantics for nominal automata ⋮ Merging Hierarchically-Structured Documents in Workflow Systems ⋮ Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
This page was built for publication: Generic Trace Semantics via Coinduction