scientific article

MaRDI QIDQ3384888

Dino Mandrioli, Matteo Pradella, Michele Chiari

Publication date: 17 December 2021

Full work available at URL: https://arxiv.org/abs/1809.03100

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

model checkinglinear temporal logicvisibly pushdown languagesoperator precedence languagesinput driven languages

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Model-checking structured context-free languages ⋮ Operator precedence temporal logic and model checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Generalizing input-driven languages: theoretical and practical benefits
• Operator precedence and the visibly pushdown property
• Pushdown processes: Games and model-checking
• The complexity of first-order and monadic second-order logic revisited
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
• Weak Second‐Order Arithmetic and Finite Automata
• Adding nesting structure to words
• First-Order and Temporal Logics for Nested Words
• Algebraic properties of operator precedence languages
• Syntactic Analysis and Operator Precedence
• Parsing Techniques
• Parenthesis Grammars
• Reachability analysis of pushdown automata: Application to model-checking

This page was built for publication: