Linear-time logics -- a coalgebraic perspective
From MaRDI portal
Cites work
- A coalgebraic approach to linear-time logics
- A fixpoint theorem for complete categories
- A lattice-theoretical fixpoint theorem and its applications
- Algebra and Coalgebra in Computer Science
- An automata-theoretic approach to linear temporal logic
- Canonical coalgebraic linear time logics
- Coalgebraic logic
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Coalgebraic trace semantics via forgetful logics
- Constructive versions of Tarski's fixed point theorems
- Expressivity of coalgebraic modal logic: the limits and beyond
- EXPTIME tableaux for the coalgebraic \(\mu\)-calculus
- From branching to linear time, coalgebraically
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 1318521 (Why is no real title available?)
- scientific article; zbMATH DE number 1796614 (Why is no real title available?)
- scientific article; zbMATH DE number 2108378 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Lattice Automata
- Maximal traces and path-based coalgebraic temporal logics
- Model Checking Quantitative Linear Time Logic
- Parity Automata for Quantitative Linear Time Logics
- Real analysis
- Resource-aware automata and games for optimal synthesis
- Rudiments of \(\mu\)-calculus
- Scalars, monads and categories
- Trace semantics via determinization
- Universal coalgebra: A theory of systems
- Weighted automata and multi-valued logics over arbitrary bounded lattices
This page was built for publication: Linear-time logics -- a coalgebraic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563060)
