Coalgebraic Trace Semantics via Forgetful Logics
From MaRDI portal
Publication:2948557
DOI10.1007/978-3-662-46678-0_10zbMath1459.68114arXiv1611.05183OpenAlexW813146449MaRDI QIDQ2948557
Publication date: 1 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.05183
Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Categorical semantics of formal languages (18C50)
Related Items (10)
Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ Iterated covariant powerset is not a monad ⋮ Convexity via Weak Distributive Laws ⋮ Unnamed Item ⋮ Coalgebraic trace semantics via forgetful logics ⋮ Combining semilattices and semimodules ⋮ Coalgebraic minimization of automata by initiality and finality ⋮ Duality of Equations and Coequations via Contravariant Adjunctions ⋮ Quantitative simulations by matrices ⋮ Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic
This page was built for publication: Coalgebraic Trace Semantics via Forgetful Logics
