scientific article; zbMATH DE number 7278119

DOI10.4230/LIPIcs.FSTTCS.2017.47zbMath1491.68114arXiv1708.00699MaRDI QIDQ5136340

Alexander Weinert

Publication date: 25 November 2020

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

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

zbMATH Keywords

model checkingsatisfiabilitytree automatavisibly pushdown languagesvisibly linear dynamic logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Visibly linear dynamic logic

Uses Software

• SPIN
• PGSolver
• GitHub

Cites Work

• Visibly linear temporal logic
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
• Alternating-time temporal logic
• Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
• Visibly pushdown languages
• Nondeterministic Tree Automata
• Visibly Linear Dynamic Logic
• From linear time to branching time
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: