The Complexity of Two-Way Pushdown Automata and Recursive Programs

Author(s):  
Wojciech Rytter
1991 ◽  
Vol 14 (2) ◽  
pp. 261-281
Author(s):  
Fred Kröger ◽  
Stephan Merz

We propose a temporal logic based on structures divided into several layers of linear “time scales” and give a sound and complete derivation system. The logic is applied to the formulation and verification of assertions about sequential recursive programs.


2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.


2015 ◽  
Vol 17 (1) ◽  
pp. 1-45 ◽  
Author(s):  
Rémy Chrétien ◽  
Véronique Cortier ◽  
Stéphanie Delaune

2021 ◽  
Vol 117 ◽  
pp. 202-241
Author(s):  
Lorenzo Clemente ◽  
Sławomir Lasota
Keyword(s):  

2019 ◽  
pp. 161-182
Author(s):  
Ganesh Lalitha Gopalakrishnan
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document