Author:
Bojańczyk Mikolaj,Walukiewicz Igor
Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. M. Benedikt, L. Segoufin, Regular tree languages definable in fo, in: STACS’05, Lecture Notes in Computer Science, 2005, to appear.
2. ‘Sometimes’ and ‘not never’ revisited: on branching versus linear time temporal logic;Emerson;J. ACM,1986
3. Decidability of model-checking for infinite-state concurrent systems;Esparza;Acta Inform.,1997
4. Propositional dynamic logic of regular programs;Fischer;J. Comput. System Sci.,1979
5. M. Franceschet, L. Afanasiev, M. de Rijke, M. Marx, CTL model checking for processing simple XPath queries, in: Temporal Presentation and Reasoning.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Weak Separation Problem for Tree Languages;International Journal of Foundations of Computer Science;2020-08
2. The mu-calculus and Model Checking;Handbook of Model Checking;2018
3. On Pseudovarieties of Forest Algebras;International Journal of Foundations of Computer Science;2016-12
4. Deciding Twig-definability of Node Selecting Tree Automata;Theory of Computing Systems;2015-04-17
5. EF+EX Forest Algebras;Algebraic Informatics;2015