{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:03:48Z","timestamp":1743098628413,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031770180"},{"type":"electronic","value":"9783031770197"}],"license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-77019-7_7","type":"book-chapter","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:47:28Z","timestamp":1732222048000},"page":"114-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Concurrent Program Algebra and Demonic Automata"],"prefix":"10.1007","author":[{"given":"Emil","family":"Sekerinski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4204\/eptcs.3.4","volume":"3","author":"M Almeida","year":"2009","unstructured":"Almeida, M., Moreira, N., Reis, R.: Testing the equivalence of regular languages. Electron. Proc. Theor. Comput. Sci. 3, 47\u201357 (2009). https:\/\/doi.org\/10.4204\/eptcs.3.4","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Back, R.J., Wright, J.V.: Refinement Calculus: a Systematic Introduction. Springer-Verlag (1998). https:\/\/doi.org\/10.1007\/978-1-4612-1674-2","DOI":"10.1007\/978-1-4612-1674-2"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Proceedings of 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 457\u2013468. POPL \u201913, Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2429069.2429124","DOI":"10.1145\/2429069.2429124"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0029355","volume-title":"Operating Systems","author":"RH Campbell","year":"1974","unstructured":"Campbell, R.H., Habermann, A.N.: The specification of process synchronization by path expressions. In: Gelenbe, E., Kaiser, C. (eds.) Operating Systems, pp. 89\u2013102. Springer, Berlin, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0029355"},{"key":"7_CR5","series-title":"CAV 2006","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11817963_5","volume-title":"Computer Aided Verification","author":"M De Wulf","year":"2006","unstructured":"De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.F.: Antichains: a new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) Computer Aided Verification. CAV 2006, pp. 17\u201330. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_5"},{"key":"7_CR6","series-title":"SETTA 2017","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-319-69483-2_13","volume-title":"Dependable Software Engineering. Theories, Tools, and Applications","author":"C Fu","year":"2017","unstructured":"Fu, C., Deng, Y., Jansen, D.N., Zhang, L.: On equivalence checking of nondeterministic finite automata. In: Larsen, K.G., Sokolsky, O., Wang, J. (eds.) Dependable Software Engineering. Theories, Tools, and Applications. SETTA 2017, pp. 216\u2013231. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69483-2_13"},{"key":"7_CR7","unstructured":"Garg, V.K.: Modeling of distributed systems by concurrent regular expressions. In: Proceedings of the IFIP TC\/WG6.1 Second International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, pp. 313\u2013327. FORTE \u201989, North-Holland Publishing Co. (1989)"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2071368.2071372","volume":"13","author":"W Gelade","year":"2012","unstructured":"Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. ACM Trans. Comput. Logic 13(1), 1 (2012). https:\/\/doi.org\/10.1145\/2071368.2071372","journal-title":"ACM Trans. Comput. Logic"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"T Hoare","year":"2011","unstructured":"Hoare, T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. J. Logic Algebraic Program. 80(6), 266\u2013296 (2011). https:\/\/doi.org\/10.1016\/j.jlap.2011.04.005","journal-title":"J. Logic Algebraic Program."},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.jlamp.2015.09.012","volume":"85","author":"T Hoare","year":"2016","unstructured":"Hoare, T., van Staden, S., M\u00f6ller, B., Struth, G., Zhu, H.: Developments in concurrent Kleene algebra. J. Log. Algebr. Methods Programm. 85(4), 617\u2013636 (2016). https:\/\/doi.org\/10.1016\/j.jlamp.2015.09.012","journal-title":"J. Log. Algebr. Methods Programm."},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994). https:\/\/doi.org\/10.1006\/inco.1994.1037","journal-title":"Inf. Comput."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"78","DOI":"10.7551\/mitpress\/4286.001.00","volume-title":"Logic and Information Flow","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: On action algebras. In: van Eijck, J., Visser, A. (eds.) Logic and Information Flow, pp. 78\u201388. MIT Press (1994). https:\/\/doi.org\/10.7551\/mitpress\/4286.001.00"},{"issue":"3","key":"7_CR13","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. Program. Lang. Syst. 19(3), 427\u2013443 (1997). https:\/\/doi.org\/10.1145\/256167.256195","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.scico.2006.01.010","volume":"65","author":"B M\u00f6ller","year":"2007","unstructured":"M\u00f6ller, B.: Kleene getting lazy. Sci. Comput. Program. 65(2), 195\u2013214 (2007). https:\/\/doi.org\/10.1016\/j.scico.2006.01.010","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(88)90049-7","volume":"60","author":"AW Roscoe","year":"1988","unstructured":"Roscoe, A.W., Hoare, C.A.R.: The laws of OCCAM programming. Theor. Comput. Sci. 60(2), 177\u2013229 (1988). https:\/\/doi.org\/10.1016\/0304-3975(88)90049-7","journal-title":"Theor. Comput. Sci."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3371129","volume":"4","author":"S Smolka","year":"2020","unstructured":"Smolka, S., Foster, N., Hsu, J., Kapp\u00e9, T., Kozen, D., Silva, A.: Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. Proc. ACM Program. Lang. 4, 1 (2020). https:\/\/doi.org\/10.1145\/3371129","journal-title":"Proc. ACM Program. Lang."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77019-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T21:29:40Z","timestamp":1732224580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77019-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"ISBN":["9783031770180","9783031770197"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77019-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"22 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2024.cs.ait.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}