The following pages link to The complexity of verification (Q2817629):
Displaying 8 items.
- Parametric runtime verification is NP-complete and coNP-complete (Q522961) (← links)
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata (Q685507) (← links)
- An efficient approach for abstraction-refinement in model checking (Q690465) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
- Minimal length test vectors for multiple-fault detection (Q1826631) (← links)
- From complementation to certification (Q2575735) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
