Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
From MaRDI portal
Publication:5054804
DOI10.1007/3-540-61422-2_117zbMath1502.68383OpenAlexW1517566730MaRDI QIDQ5054804
Jan Arne Telle, Monika R. Henzinger
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61422-2_117
Analysis of algorithms (68W40) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)
Related Items (5)
Model checking with fairness assumptions using PAT ⋮ On the complexity of rational verification ⋮ Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋮ Unnamed Item ⋮ On-the-fly Emptiness Check of Transition-Based Streett Automata
Cites Work
This page was built for publication: Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning