Maximal traces and path-based coalgebraic temporal logics
From MaRDI portal
Publication:639645
DOI10.1016/J.TCS.2011.04.025zbMath1254.68147OpenAlexW2064284596MaRDI QIDQ639645
Publication date: 22 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.025
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (4)
Coinductive predicates and final sequences in a fibration ⋮ Unnamed Item ⋮ Quantitative simulations by matrices ⋮ Coinductive predicates and final sequences in a fibration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expressive logics for coalgebras via terminal sequence induction
- Results on the propositional \(\mu\)-calculus
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- Semantics of weakening and contraction
- A logic for reasoning about time and reliability
- Universal coalgebra: A theory of systems
- Modular construction of complete coalgebraic logics
- Modular Games for Coalgebraic Fixed Point Logics
- Traces, Executions and Schedulers, Coalgebraically
- Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
- Terminal Coalgebras for Measure-Polynomial Functors
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- “Sometimes” and “not never” revisited
- Generic Trace Semantics via Coinduction
- Algebra and Coalgebra in Computer Science
This page was built for publication: Maximal traces and path-based coalgebraic temporal logics
