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.68383MaRDI 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
68W40: Analysis of algorithms
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
68M12: Network protocols
Related Items
Unnamed Item, On the complexity of rational verification, Model checking with fairness assumptions using PAT, Mechanizing the Powerset Construction for Restricted Classes of ω-Automata, On-the-fly Emptiness Check of Transition-Based Streett Automata
Cites Work