{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:53:54Z","timestamp":1725828834256},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319235059"},{"type":"electronic","value":"9783319235066"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23506-6_11","type":"book-chapter","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T11:50:40Z","timestamp":1441281040000},"page":"152-171","source":"Crossref","is-referenced-by-count":11,"title":["No Need Knowing Numerous Neighbours"],"prefix":"10.1007","author":[{"given":"Martin","family":"Fr\u00e4nzle","sequence":"first","affiliation":[]},{"given":"Michael R.","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Heinrich","family":"Ody","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,10]]},"reference":[{"issue":"11","key":"11_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"JF Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832\u2013843 (1983)","journal-title":"Communications of the ACM"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"Z Chaochen","year":"1991","unstructured":"Chaochen, Z., Hoare, C.A.R., Ravn, A.P.: A calculus of durations. Information Processing Letters 40(5), 269\u2013276 (1991)","journal-title":"Information Processing Letters"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1145\/115234.115351","volume":"38","author":"JY Halpern","year":"1991","unstructured":"Halpern, J.Y., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM (JACM) 38(4), 935\u2013962 (1991)","journal-title":"Journal of the ACM (JACM)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-24559-6_28","volume-title":"Formal Methods and Software Engineering","author":"M Hilscher","year":"2011","unstructured":"Hilscher, M., Linker, S., Olderog, E.-R., Ravn, A.P.: An Abstract Model for Proving Safety of Multi-lane Traffic Manoeuvres. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 404\u2013419. Springer, Heidelberg (2011)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Hilscher, M., Linker, S., Olderog, E.-R.: Proving Safety of Traffic Manoeuvres on Country Roads. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 8051, pp. 196\u2013212. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-39698-4_12"},{"key":"11_CR6","unstructured":"Klebelsberg, D.: Verkehrspsychologie. Springer (2013)"},{"key":"11_CR7","unstructured":"Linker, S.: Proofs for traffic safety : combining diagrams and logic. Ph.D. thesis, Carl von Ossietzky University of Oldenburg (2015)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-39718-9_14","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2013","author":"S Linker","year":"2013","unstructured":"Linker, S., Hilscher, M.: Proof Theory of a Multi-Lane Spatial Logic. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) ICTAC 2013. LNCS, vol. 8049, pp. 231\u2013248. Springer, Heidelberg (2013)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-89439-1_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Monniaux","year":"2008","unstructured":"Monniaux, D.: A Quantifier Elimination Algorithm for Linear Real Arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 243\u2013257. Springer, Heidelberg (2008)"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MC.1985.1662795","volume":"18","author":"B Moszkowski","year":"1985","unstructured":"Moszkowski, B.: A temporal logic for multi-level reasoning about hardware. IEEE Computer 18(2), 10\u201319 (1985)","journal-title":"IEEE Computer"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Ody, H.: Analysing decision problems of multi-lane spatial logic (2015) (manuscript). \n                      http:\/\/theoretica.informatik.uni-oldenburg.de\/ sefie\/files\/decidability.pdf","DOI":"10.1007\/978-3-319-25150-9_24"},{"key":"11_CR12","unstructured":"Olderog, E.-R., Ravn, A.P., Wisniewski, R.: Linking Discrete and Continuous Models (2014) (manuscript)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-31862-0_33","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"A Sch\u00e4fer","year":"2005","unstructured":"Sch\u00e4fer, A.: A Calculus for Shapes in Time and Space. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 463\u2013477. Springer, Heidelberg (2005)"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1093\/logcom\/1.4.453","volume":"1","author":"Y Venema","year":"1991","unstructured":"Venema, Y.: A modal logic for chopping intervals. Journal of Logic and Computation 1(4), 453\u2013476 (1991)","journal-title":"Journal of Logic and Computation"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: ISSAC, pp. 129\u2013136. ACM (1999)","DOI":"10.1145\/309831.309888"},{"key":"11_CR16","unstructured":"Woodcock, J., Davies, J.: Using Z \u2013 Specification, Refinement, and Proof. Prentice Hall (1996)"}],"container-title":["Lecture Notes in Computer Science","Correct System Design"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23506-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:31:30Z","timestamp":1559251890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23506-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319235059","9783319235066"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23506-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}