Minimization of Visibly Pushdown Automata Using Partial Max-SAT
From MaRDI portal
Publication:3303909
DOI10.1007/978-3-662-54577-5_27zbMath1452.68107arXiv1701.05160OpenAlexW2582132278MaRDI QIDQ3303909
Daniel Tischner, Christian Schilling, Matthias Heizmann
Publication date: 5 August 2020
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.05160
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A minimized automaton representation of reachable states
- Reduction of nondeterministic tree automata
- Forest automata for verification of heap manipulation
- Advanced automata minimization
- Büchi Automata Can Have Smaller Quotients
- MONA IMPLEMENTATION SECRETS
- Model Checking Procedural Programs
- Adding nesting structure to words
- SAT-Based Minimization of Deterministic $$\omega $$ -Automata
- Minimizing Variants of Visibly Pushdown Automata
- Visibly pushdown languages
- Beyond Language Equivalence on Visibly Pushdown Automata
- Minimising Deterministic Büchi Automata Precisely Using SAT Solving
- Nested interpolants
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Trimming Visibly Pushdown Automata
- Experimental Evaluation of Classical Automata Constructions
- Minimization of symbolic automata
- Visibly Pushdown Transducers for Approximate Validation of Streaming XML
- Automata, Languages and Programming
- On Solving the Partial MAX-SAT Problem
- Minimization, Learning, and Conformance Testing of Boolean Programs