{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:22:49Z","timestamp":1725988969694},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002435"},{"type":"electronic","value":"9783030002442"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00244-2_8","type":"book-chapter","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T04:12:38Z","timestamp":1535602358000},"page":"115-130","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Progress Checking for Dummies"],"prefix":"10.1007","author":[{"given":"Antti","family":"Valmari","sequence":"first","affiliation":[]},{"given":"Henri","family":"Hansen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Dyseryn, V., van Glabbeek, R.J., H\u00f6fner, P.: Analysing mutual exclusion using process algebra with signals. In: Peters, K., Tini, S. (eds.) Proceedings of EXPRESS\/SOS 2017, Berlin, Germany, 4 September 2017. EPTCS, vol. 255, pp. 18\u201334 (2017)","DOI":"10.4204\/EPTCS.255.2"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BFb0084793","volume-title":"CONCUR \u201992","author":"R Kaivola","year":"1992","unstructured":"Kaivola, R., Valmari, A.: The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 207\u2013221. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/BFb0084793"},{"key":"8_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems - Specification","author":"Z Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems - Specification. Springer, New York (1992). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-0931-7"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-73370-6_17","volume-title":"Model Checking Software","author":"R Pel\u00e1nek","year":"2007","unstructured":"Pel\u00e1nek, R.: BEEM: benchmarks for explicit model checkers. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 263\u2013267. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73370-6_17"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"GL Peterson","year":"1981","unstructured":"Peterson, G.L.: Myths about the mutual exclusion problem. Inf. Process. Lett. 12(3), 115\u2013116 (1981)","journal-title":"Inf. Process. Lett."},{"key":"8_CR6","unstructured":"Reeves, G.E.: What really happened on Mars? (1997). \nhttps:\/\/www.cs.unc.edu\/%7eanderson\/teach\/comp790\/papers\/mars_pathfinder_long_version.html\n\n. Accessed 7 May 2018"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Inf. Comput. 205(2), 125\u2013198 (2007)","journal-title":"Inf. Comput."},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0020-0190(94)00214-J","volume":"53","author":"A Valmari","year":"1995","unstructured":"Valmari, A.: The weakest deadlock-preserving congruence. Inf. Process. Lett. 53(6), 341\u2013346 (1995)","journal-title":"Inf. Process. Lett."},{"key":"8_CR9","unstructured":"Valmari, A.: A chaos-free failures divergences semantics with applications to verification. In: Davies, J., Roscoe, B., Woodcock, J. (eds.) Millennial Perspectives in Computer Science: Proceedings of the 1999 Oxford-Microsoft Symposium in Honour of Sir Tony Hoare, Cornerstones of Computing, pp. 365\u2013382. Palgrave (2000)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-60973-3_90","volume-title":"FME\u201996: Industrial Benefit and Advances in Formal Methods","author":"A Valmari","year":"1996","unstructured":"Valmari, A., Set\u00e4l\u00e4, M.: Visual verification of safety and liveness. In: Gaudel, M.-C., Woodcock, J. (eds.) FME 1996. LNCS, vol. 1051, pp. 228\u2013247. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-60973-3_90"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BF01211218","volume":"7","author":"A Valmari","year":"1995","unstructured":"Valmari, A., Tienari, M.: Compositional failure-based semantics models for basic LOTOS. Formal Asp. Comput. 7(4), 440\u2013468 (1995)","journal-title":"Formal Asp. Comput."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-32582-8_16","volume-title":"Model Checking Software","author":"A Valmari","year":"2016","unstructured":"Valmari, A., Vogler, W.: Fair testing and stubborn sets. In: Bo\u0161na\u010dki, D., Wijs, A. (eds.) SPIN 2016. LNCS, vol. 9641, pp. 225\u2013243. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-32582-8_16"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","year":"1992","unstructured":"Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/3-540-55767-9"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Industrial Critical Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00244-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T04:19:53Z","timestamp":1535602793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00244-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002435","9783030002442"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00244-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}