{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:27Z","timestamp":1725544587187},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333395"},{"type":"electronic","value":"9783540333401"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11734673_10","type":"book-chapter","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T21:59:04Z","timestamp":1151963944000},"page":"121-133","source":"Crossref","is-referenced-by-count":2,"title":["Towards an Algebra of Hybrid Systems"],"prefix":"10.1007","author":[{"given":"Peter","family":"H\u00f6fner","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"M\u00f6ller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-24771-5_4","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","author":"R. Backhouse","year":"2004","unstructured":"Backhouse, R., Michaelis, D.: Fixed-Point Characterisation of Winning Strategies in Impartial Games. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol.\u00a03051, pp. 34\u201347. Springer, Heidelberg (2004)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/10722010_4","volume-title":"Mathematics of Program Construction","author":"E. Cohen","year":"2000","unstructured":"Cohen, E.: Separation and Reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 45\u201359. Springer, Heidelberg (2000)"},{"key":"10_CR3","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Boca Raton (1971)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/5.871305","volume":"88","author":"J.M. Davoren","year":"2000","unstructured":"Davoren, J.M., Nerode, A.: Logics for Hybrid Systems. Proc. IEEE\u00a088, 985\u20131010 (2000)","journal-title":"Proc. IEEE"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Kleene Algebra with Domain. ACM Trans. Computational Logic (to appear, 2006); Preliminary version: Universit\u00e4t Augsburg, Institut f\u00fcr Informatik, Report No. 2003-07 (June 2003)","DOI":"10.1145\/1183278.1183285"},{"key":"10_CR6","first-page":"93","volume":"1","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Modal Kleene Algebra and Applications \u2013 A Survey. J. Relational Methods in Computer Science\u00a01, 93\u2013131 (2004), http:\/\/www.cosc.brocku.ca\/Faculty\/Winter\/JoRMiCS\/","journal-title":"J. Relational Methods in Computer Science"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Henzinger, T.: The Theory of Hybrid Automata. In: Proc. 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, pp. 278\u2013292 (1996)","DOI":"10.1109\/LICS.1996.561342"},{"key":"10_CR8","unstructured":"H\u00f6fner, P.: From Sequential Algebra to Kleene Algebra: Interval Modalities and Duration Calculus. Technical Report 2005-5, Institut f\u00fcr Informatik, Universit\u00e4t Augsburg (2005)"},{"key":"10_CR9","unstructured":"H\u00f6fner, P.: An Algebraic Semantics for Duration Calculus. In: 17th European Summer School in Logic, Language and Information (ESSLLI), Proc. 10th ESSLLI Student Session, Heriot-Watt University Edinburgh, Scotland, August 2005, pp. 99\u2013111 (2005)"},{"key":"10_CR10","unstructured":"Isaacs, R.: Differential Games. Wiley, Chichester (1965) Republished: Dover (1999)"},{"key":"10_CR11","unstructured":"von Karger, B.: Temporal Algebra. Habilitation thesis, University of Kiel (1997)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene Algebra with Tests. ACM Trans. Programming Languages and Systems\u00a019, 427\u2013443 (1997)","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0890-5401(03)00067-1","volume":"185","author":"N.A. Lynch","year":"2003","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Hybrid I\/O Automata. Information and Computation\u00a0185, 105\u2013157 (2003)","journal-title":"Information and Computation"},{"key":"10_CR14","unstructured":"M\u00f6ller, B.: Complete Tests do not Guarantee Domain. Technical Report 2005-6, Institut f\u00fcr Informatik, Universit\u00e4t Augsburg (2005)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-27764-4_14","volume-title":"Mathematics of Program Construction","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B.: Lazy Kleene Algebra. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 252\u2013273. Springer, Heidelberg (2004)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-39993-3_14","volume-title":"From Object-Orientation to Formal Methods \u2014 Essays in Memory of Ole-Johan Dahl","author":"M. Sintzoff","year":"2004","unstructured":"Sintzoff, M.: Iterative Synthesis of Control Guards Ensuring Invariance and Inevitability in Discrete-Decision Games. In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From Object-Orientation to Formal Methods. LNCS, vol.\u00a02635, pp. 272\u2013301. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734673_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T19:24:53Z","timestamp":1555701893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734673_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333395","9783540333401"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11734673_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}