{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:06:26Z","timestamp":1725858386386},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319415901"},{"type":"electronic","value":"9783319415918"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41591-8_9","type":"book-chapter","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T17:27:27Z","timestamp":1466702847000},"page":"121-136","source":"Crossref","is-referenced-by-count":2,"title":["Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis"],"prefix":"10.1007","author":[{"given":"Jaroslav","family":"Bend\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikola","family":"Bene\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Barnat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"\u010cern\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,23]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-30557-6_14","volume-title":"Practical Aspects of Declarative Languages","author":"J Bailey","year":"2005","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2004. LNCS, vol. 3350, pp. 174\u2013186. Springer, Heidelberg (2005)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00165-015-0348-9","volume":"28","author":"J Barnat","year":"2016","unstructured":"Barnat, J., Bauch, P., Bene\u0161, N., Brim, L., Beran, J., Kratochv\u00edla, T.: Analysing sanity of requirements for avionics systems. Form. Aspects Comput. 28(1), 45\u201363 (2016). doi: 10.1007\/s00165-015-0348-9","journal-title":"Form. Aspects Comput."},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/978-3-642-33826-7_4","volume-title":"Software Engineering and Formal Methods","author":"J Barnat","year":"2012","unstructured":"Barnat, J., Bauch, P., Brim, L.: Checking sanity of software requirements. In: Eleftherakis, G., Hinchey, M., Holcombe, M. (eds.) SEFM 2012. LNCS, vol. 7504, pp. 48\u201362. Springer, Heidelberg (2012)"},{"issue":"3","key":"9_CR4","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1109\/TCBB.2011.110","volume":"9","author":"J Barnat","year":"2012","unstructured":"Barnat, J., Brim, L., Krejci, A., Streck, A., Safranek, D., Vejnar, M., Vejpustek, T.: On parameter synthesis by parallel model checking. IEEE\/ACM Trans. Comput. Biol. Bioinform. 9(3), 693\u2013705 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"2","key":"9_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1008779610539","volume":"18","author":"I Beer","year":"2001","unstructured":"Beer, I., Ben-David, S., Eisner, C., Rodeh, Y.: Efficient detection of vacuity in temporal model checking. Form. Methods Syst. Des. 18(2), 141\u2013163 (2001)","journal-title":"Form. Methods Syst. Des."},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.3233\/SAT190094","volume":"8","author":"A Belov","year":"2012","unstructured":"Belov, A., Marques-Silva, J.: MUSer2: an efficient MUS extractor. J. Satisfiability Boolean Model. Comput. 8, 123\u2013128 (2012)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: On the decomposition of posets. In: 2012 International Conference on Computer Science Service System (CSSS), pp. 134\u2013138 (2012)","DOI":"10.1109\/CSSS.2012.41"},{"key":"9_CR8","volume-title":"Model Checking","author":"E Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-44829-2_3","volume-title":"Model Checking Software","author":"S Dajani-Brown","year":"2003","unstructured":"Dajani-Brown, S., Cofer, D., Hartmann, A.C., Pratt, T.W.: Formal modeling and analysis of an avionics triplex sensor voter. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 34\u201348. Springer, Heidelberg (2003)"},{"issue":"1","key":"9_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(1), 161\u2013166 (1950)","journal-title":"Ann. Math."},{"issue":"4","key":"9_CR11","first-page":"701","volume":"7","author":"DR Fulkerson","year":"1956","unstructured":"Fulkerson, D.R.: Note on Dilworth\u2019s decomposition theorem for partially ordered sets. Proc. Am. Math. Soc. 7(4), 701\u2013702 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/1378727.1378742","volume":"51","author":"M Hinchey","year":"2008","unstructured":"Hinchey, M., Jackson, M., Cousot, P., Cook, B., Bowen, J.P., Margaria, T.: Software engineering and formal methods. Commun. ACM 51, 54\u201359 (2008)","journal-title":"Commun. ACM"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Joshi, A., Miller, S.P., Whalen, M., Heimdahl, M.P.: A proposal for model-based safety analysis. In: The 24th Digital Avionics Systems Conference, 2005. DASC 2005, vol. 2. IEEE (2005)","DOI":"10.1109\/DASC.2005.1563469"},{"key":"9_CR14","unstructured":"Lauria, M.: CNFgen formula generator. http:\/\/massimolauria.github.io\/cnfgen\/ . Accessed 11 Jan 2016"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Liffiton, M.H., Previti, A., Malik, A., Marques-Silva, J.: Fast, flexible MUS enumeration. Constraints 21(2), 223\u2013250 (2016). http:\/\/link.springer.com\/article\/10.1007%2Fs10601-015-9183-0","DOI":"10.1007\/s10601-015-9183-0"},{"issue":"1","key":"9_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reason. 40(1), 1\u201333 (2008)","journal-title":"J. Autom. Reason."}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41591-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T20:13:43Z","timestamp":1600805623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41591-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319415901","9783319415918"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41591-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}