On the Complexity of Semantic Self-minimization

DOI10.1016/j.entcs.2009.08.002zbMath1339.68162OpenAlexW2100973900MaRDI QIDQ2810966

Adam Antonik

Publication date: 6 June 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.002

zbMATH Keywords

computational complexitysupervaluations3-valued model checkingpartial state spaces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Modal and mixed specifications: key decision problems and their complexities ⋮ EXPTIME-complete Decision Problems for Modal and Mixed Specifications

Cites Work

• Results on the propositional \(\mu\)-calculus
• The complexity of facets (and some facets of complexity)
• The complexity of facets resolved
• Complexity of Decision Problems for Mixed and Modal Specifications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Complexity of Semantic Self-minimization