{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:30:49Z","timestamp":1775097049229,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031280825","type":"print"},{"value":"9783031280832","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-28083-2_6","type":"book-chapter","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T09:03:07Z","timestamp":1678179787000},"page":"87-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Compatibility of Refining and Controlling Plant Automata with Bisimulation Quotients"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7909-1942","authenticated-orcid":false,"given":"Roland","family":"Gl\u00fcck","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00165-020-00521-4","volume":"33","author":"G Bacci","year":"2020","unstructured":"Bacci, G., Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Reynier, P.-A.: Optimal and robust controller synthesis using energy timed automata with uncertainty. Form. Asp. Comput. 33(1), 3\u201325 (2020). https:\/\/doi.org\/10.1007\/s00165-020-00521-4","journal-title":"Form. Asp. Comput."},{"key":"6_CR2","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24\u201326 October 1988, pp. 328\u2013337. IEEE Computer Society (1988)","DOI":"10.1109\/SFCS.1988.21949"},{"key":"6_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Company, NY (1979)"},{"key":"6_CR5","unstructured":"Gl\u00fcck, R.: Bisimulations and model refinement (preprint). http:\/\/rolandglueck.de\/html\/PreprintDiss.pdf"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-21070-9_14","volume-title":"Relational and Algebraic Methods in Computer Science","author":"R Gl\u00fcck","year":"2011","unstructured":"Gl\u00fcck, R.: Using bisimulations for optimality problems in model refinement. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol. 6663, pp. 164\u2013179. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21070-9_14"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-04639-1_10","volume-title":"Relations and Kleene Algebra in Computer Science","author":"R Gl\u00fcck","year":"2009","unstructured":"Gl\u00fcck, R., M\u00f6ller, B., Sintzoff, M.: A semiring approach to equivalences, bisimulations and control. In: Berghammer, R., Jaoua, A.M., M\u00f6ller, B. (eds.) RelMiCS 2009. LNCS, vol. 5827, pp. 134\u2013149. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04639-1_10"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-17796-5_5","volume-title":"Algebraic Methodology and Software Technology","author":"R Gl\u00fcck","year":"2011","unstructured":"Gl\u00fcck, R., M\u00f6ller, B., Sintzoff, M.: Model refinement using bisimulation quotients. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 76\u201391. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17796-5_5"},{"key":"6_CR9","unstructured":"Gl\u00fcck, R.: Bisimulations and model refinement. PhD thesis, University of Augsburg. Pro Business (2015)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-59042-0_76","volume-title":"STACS 95","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229\u2013242. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_76"},{"key":"6_CR11","first-page":"112","volume":"57","author":"J Myhill","year":"1957","unstructured":"Myhill, J.: Finite automata and the representation of events. WADD Tech. Rep. 57, 112\u2013137 (1957)","journal-title":"WADD Tech. Rep."},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9(4), 541\u2013544 (1958)","journal-title":"Proc. Am. Math. Soc."},{"issue":"6","key":"6_CR13","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-76637-7_24","volume-title":"Programming Languages and Systems","author":"D Pous","year":"2007","unstructured":"Pous, D.: Complete lattices and up-to techniques. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 351\u2013366. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76637-7_24"},{"key":"6_CR15","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1\u201335 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"PJ Ramadge","year":"1989","unstructured":"Ramadge, P.J., Wonham, W.M.: The control of discrete event systems. Proc. IEEE 77, 81\u201398 (1989)","journal-title":"Proc. IEEE"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"76351","DOI":"10.1109\/ACCESS.2022.3192436","volume":"10","author":"FG Rey de Souza","year":"2022","unstructured":"Rey de Souza, F.G., Hirata, C.M., Nadjm-Tehrani, S.: Synthesis of a controller algorithm for safety-critical systems. IEEE Access 10, 76351\u201376375 (2022)","journal-title":"IEEE Access"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-642-77968-8","DOI":"10.1007\/978-3-642-77968-8"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-70594-9_18","volume-title":"Mathematics of Program Construction","author":"M Sintzoff","year":"2008","unstructured":"Sintzoff, M.: Synthesis of optimal control policies for some infinite-state transition systems. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol. 5133, pp. 336\u2013359. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70594-9_18"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. In: 12th Annual Symposium on Switching and Automata Theory (SWAT 1971), pp. 114\u2013121 (1971)","DOI":"10.1109\/SWAT.1971.10"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BFb0023782","volume-title":"Computer Science Logic","author":"JG Thistle","year":"1992","unstructured":"Thistle, J.G., Wonham, W.M.: Control of $$\\omega $$-automata, Church\u2019s problem, and the emptiness problem for tree $$\\omega $$-automata. In: B\u00f6rger, E., J\u00e4ger, G., Kleine B\u00fcning, H., Richter, M.M. (eds.) CSL 1991. LNCS, vol. 626, pp. 367\u2013381. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0023782"},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1137\/S0363012991217536","volume":"32","author":"JG Thistle","year":"1994","unstructured":"Thistle, J.G., Wonham, W.M.: Control of infinite behavior of finite automata. SIAM J. Control Optim. 32(4), 1075\u20131097 (1994)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s00165-017-0424-4","volume":"29","author":"GV Bochmann","year":"2017","unstructured":"Bochmann, G.V., Hilscher, M., Linker, S., Olderog, E.-R.: Synthesizing and verifying controllers for multi-lane traffic maneuvers. Form. Asp. Comput. 29(4), 583\u2013600 (2017). https:\/\/doi.org\/10.1007\/s00165-017-0424-4","journal-title":"Form. Asp. Comput."},{"issue":"4","key":"6_CR24","first-page":"429","volume":"83","author":"M Winter","year":"2008","unstructured":"Winter, M.: A relation-algebraic theory of bisimulations. Fundam. Inform. 83(4), 429\u2013449 (2008)","journal-title":"Fundam. Inform."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-28083-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:39:13Z","timestamp":1710268753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-28083-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031280825","9783031280832"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-28083-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics20.lis-lab.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}