Automata and fixed point logic: A coalgebraic perspective-Reference-Cited by-同舟云学术

Automata and fixed point logic: A coalgebraic perspective

Published:2006-04 Issue:4 Volume:204 Page:637-678
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Venema Yde

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference28 articles.

1. S. Abramsky. A Cook’s Tour of the Finitary Non-Well-Founded Sets. Invited Lecture at BCTCS 1988.

2. Automata and Algebras in Categories;Adámek,1990

3. A. Baltag, A logic for coalgebraic simulation, in: H. Reichel (Ed.), Coalgebraic Methods in Computer Science (CMCS’00), 2000, pp. 41–60.

4. J. Barwise, L. Moss, in: Vicious Circles, CSLI Lecture Notes, vol. 60, CSLI Publications, 1996.

5. A. Carboni, G. Kelly, R. Wood, A 2-categorical approach to change of base and geometric morphisms I, Technical Report 90-1, Department of Pure Mathematics, University of Sydney, 1990.

Cited by 61 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi;Logical Methods in Computer Science;2024-07-23

2. Automata and Coalgebras in Categories of Species;Lecture Notes in Computer Science;2024

3. A Categorical Approach to Coalgebraic Fixpoint Logic;Lecture Notes in Computer Science;2024

4. Coalgebraic CTL: Fixpoint Characterization and Polynomial-Time Model Checking;Lecture Notes in Computer Science;2024

5. Generic Model Checking for Modal Fixpoint Logics in COOL-MC;Lecture Notes in Computer Science;2023-12-30