Generic infinite traces and path-based coalgebraic temporal logics
From MaRDI portal
Publication:2919451
DOI10.1016/J.ENTCS.2010.07.015zbMATH Open1247.68173OpenAlexW2088194522MaRDI QIDQ2919451FDOQ2919451
Authors: Corina Cîrstea 
Publication date: 2 October 2012
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2010.07.015
Recommendations
Cites Work
- Title not available (Why is that?)
- Universal coalgebra: A theory of systems
- Trace semantics for coalgebras
- Modular games for coalgebraic fixed point logics
- Title not available (Why is that?)
- Generic Trace Semantics via Coinduction
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Modular construction of complete coalgebraic logics
- Expressive logics for coalgebras via terminal sequence induction
- “Sometimes” and “not never” revisited
- Coalgebraic logic over measurable spaces: behavioral and logical equivalence
- Semantics of weakening and contraction
- Traces, Executions and Schedulers, Coalgebraically
Cited In (9)
- Generic Trace Semantics via Coinduction
- A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves
- Maximal traces and path-based coalgebraic temporal logics
- Coalgebraic Infinite Traces and Kleisli Simulations
- Coalgebraic semantics of modal logics: an overview
- Title not available (Why is that?)
- A coalgebraic approach to linear-time logics
- Coalgebraic infinite traces and Kleisli simulations
- Model checking linear coalgebraic temporal logics: an automata-theoretic approach
This page was built for publication: Generic infinite traces and path-based coalgebraic temporal logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2919451)
