Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Fixed point characterization of infinite behavior of finite-state systems
Theoretical Computer Science
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modal and temporal properties of processes
Modal and temporal properties of processes
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
A compositional approach to defining logics for coalgebras
Theoretical Computer Science - Selected papers of CMCS'03
Automata and fixed point logic: a coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Modular construction of complete coalgebraic logics
Theoretical Computer Science
A Noninterleaving Model of Concurrency Based on Transition Systems with Spatial Structure
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic epistemic update without change of model
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Expressivity of coalgebraic modal logic: the limits and beyond
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
EXPTIME tableaux for the coalgebraic µ-calculus
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We build on existing work on finitary modular coalgebraic logics [C. Cirstea. A compositional approach to defining logics for coalgebras. Theoretical Computer Science, 327:45-69, 2004; C. Cirstea and D. Pattinson. Modular construction of complete coalgebraic logics. Theoretical Computer Science, 388:83-108, 2007], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation games. These results are generalisations of their correspondents in the modal @m-calculus, as described e.g. in [C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001]. Inspired by recent work of Venema [Y. Venema. Automata and fixed point logic: a coalgebraic perspective. Information and Computation, 204:637-678, 2006], we provide our logics with evaluation games that come equipped with a modular way of building the game boards. We also study a specific class of modular coalgebraic logics that allow for the introduction of an implicit negation operator.