Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis
From MaRDI portal
Publication:4571130
DOI10.1007/978-3-319-41591-8_9zbMath1390.68177OpenAlexW2503202938MaRDI QIDQ4571130
Nikola Beneš, Jaroslav Bendík, Jiří Barnat, Ivana Černá
Publication date: 6 July 2018
Published in: Software Engineering and Formal Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41591-8_9
Uses Software
Cites Work
- Fast, flexible MUS enumeration
- Analysing sanity of requirements for avionics systems
- Algorithms for computing minimal unsatisfiable subsets of constraints
- A decomposition theorem for partially ordered sets
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- Efficient detection of vacuity in temporal model checking
- Unnamed Item
- Unnamed Item