On the Hardness of Priority Synthesis
DOI10.1007/978-3-642-22256-6_11zbMath1297.68057OpenAlexW2210268884MaRDI QIDQ5200057
Christian Buckl, Alois C. Knoll, Chih-Hong Cheng, Barbara Jobstmann
Publication date: 29 July 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: http://mediatum.ub.tum.de/doc/1287142/document.pdf
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
This page was built for publication: On the Hardness of Priority Synthesis