{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T09:10:01Z","timestamp":1746177001262,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319054155"},{"type":"electronic","value":"9783319054162"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-05416-2_18","type":"book-chapter","created":{"date-parts":[[2014,4,5]],"date-time":"2014-04-05T05:41:09Z","timestamp":1396676469000},"page":"280-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Certainly Unsupervisable States"],"prefix":"10.1007","author":[{"given":"Simon","family":"Ware","sequence":"first","affiliation":[]},{"given":"Robi","family":"Malik","sequence":"additional","affiliation":[]},{"given":"Sahar","family":"Mohajerani","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Fabian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,6]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proceedings of the 9th ACM SIGSOFT International Symposium on Foundations of Software Engineering 2001, pp. 109\u2013120, Vienna, Austria (2001)","DOI":"10.1145\/503271.503226"},{"key":"18_CR2","series-title":"LNCS","first-page":"1","volume-title":"HS 1994","author":"E Asarin","year":"1995","unstructured":"Asarin, E., Maler, O., Pnueli, A.: Symbolic controller synthesis for discrete and timed systems. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol. 999, pp. 1\u201320. Springer, Heidelberg (1995)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, A., Singhal, V., Swamy, G.M., Brayton, R.K.: Minimizing interacting finite state machines: a compositional approach to language containment. In: Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD \u201994, pp. 255\u2013261 (1994)","DOI":"10.1109\/ICCD.1994.331900"},{"key":"18_CR4","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":"18_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-23217-6_34","volume-title":"CONCUR 2011","author":"C Baier","year":"2011","unstructured":"Baier, C., Klein, J., Kl\u00fcppelholz, S.: A compositional framework for controller synthesis. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 512\u2013527. Springer, Heidelberg (2011)"},{"key":"18_CR6","unstructured":"Fabian, M.: On object oriented nondeterministic supervisory control. Ph.D. thesis, Chalmers University of Technology, G\u00f6teborg, Sweden. https:\/\/publications.lib.chalmers.se\/cpl\/record\/index.xsql?pubid=1126 (1995)"},{"key":"18_CR7","series-title":"LNCS","first-page":"112","volume-title":"ATVA 2010","author":"E Filiot","year":"2010","unstructured":"Filiot, E., Jin, N., Raskin, J.-F.: Compositional algorithms for LTL synthesis. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 112\u2013127. Springer, Heidelberg (2010)"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1914","DOI":"10.1137\/070695526","volume":"48","author":"H Flordal","year":"2009","unstructured":"Flordal, H., Malik, R.: Compositional verification in supervisory control. SIAM J. Control Opt. 48(3), 1914\u20131938 (2009)","journal-title":"SIAM J. Control Opt."},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10626-007-0018-z","volume":"17","author":"H Flordal","year":"2007","unstructured":"Flordal, H., Malik, R., Fabian, M., \u00c5kesson, K.: Compositional synthesis of maximally permissive supervisors using supervision equivalence. Discrete Event Dyn. Syst. 17(4), 475\u2013504 (2007)","journal-title":"Discrete Event Dyn. Syst."},{"issue":"5","key":"18_CR10","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/3477.875441","volume":"30","author":"P Gohari","year":"2000","unstructured":"Gohari, P., Wonham, W.M.: On the complexity of supervisory control design in the RW framework. IEEE Trans. Syst. Man Cybern. 30(5), 643\u2013652 (2000)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"18_CR11","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Upper Saddle River (1985)"},{"key":"18_CR12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (2001)"},{"issue":"12","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/9.61009","volume":"35","author":"F Lin","year":"1990","unstructured":"Lin, F., Wonham, W.M.: Decentralized control and coordination of discrete-event systems with partial observation. IEEE Trans. Autom. Control 35(12), 1330\u20131337 (1990)","journal-title":"IEEE Trans. Autom. Control"},{"key":"18_CR14","unstructured":"Malik, R.: The language of certain conflicts of a nondeterministic process. Working Paper 05\/2010, Dept. of Computer Science, University of Waikato, Hamilton, New Zealand. http:\/\/hdl.handle.net\/10289\/4108 (2010)"},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1142\/S012905410600411X","volume":"17","author":"R Malik","year":"2006","unstructured":"Malik, R., Streader, D., Reeves, S.: Conflicts and fair testing. Int. J. Found. Comput. Sci. 17(4), 797\u2013813 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"18_CR16","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/TAC.2013.2283109","volume":"59","author":"S. Mohajerani","year":"2014","unstructured":"Mohajerani, S., Malik, R., Fabian, M.: A framework for compositional synthesis of modular nonblocking supervisors. IEEE Trans. Autom. Control. 59(1), 150\u2013162 (2014)","journal-title":"IEEE Trans. Autom. Control."},{"issue":"3\u20135","key":"18_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jlap.2009.12.001","volume":"79","author":"AJ Mooij","year":"2010","unstructured":"Mooij, A.J., Stahl, C., Voorhoeve, M.: Relating fair testing and accordance for service replaceability. J. Logic Algebr. Program. 79(3\u20135), 233\u2013244 (2010)","journal-title":"J. Logic Algebr. Program."},{"key":"18_CR18","series-title":"Acta Polytechnica Scandinavica, Mathematics and Computing in Engineering Series","volume-title":"Efficient transitive closure computation in large digraphs","author":"E Nuutila","year":"1995","unstructured":"Nuutila, E.: Efficient transitive closure computation in large digraphs. Acta Polytechnica Scandinavica, Mathematics and Computing in Engineering Series, vol. 74. Finnish Academy of Technology, Helsinki (1995)"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pacific J. Math."},{"key":"18_CR21","series-title":"LNCIS","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/BFb0008476","volume-title":"Three Decades of Mathematical System Theory","author":"WM Wonham","year":"1989","unstructured":"Wonham, W.M.: On the control of discrete-event systems. In: Nijmeijer, H., Schumacher, J.M. (eds.) Three Decades of Mathematical System Theory. LNCIS, vol. 135, pp. 542\u2013562. Springer, Heidelberg (1989)"}],"container-title":["Communications in Computer and Information Science","Formal Techniques for Safety-Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05416-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T08:46:57Z","timestamp":1746175617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05416-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319054155","9783319054162"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05416-2_18","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 April 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}