{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:50:32Z","timestamp":1742953832926,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031156281"},{"type":"electronic","value":"9783031156298"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15629-8_7","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:26:53Z","timestamp":1664036813000},"page":"116-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Better Automata Through Process Algebra"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4952-5380","authenticated-orcid":false,"given":"Rance","family":"Cleaveland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Arden, D.N.: Delayed-logic and finite-state machines. In: 2nd Annual Symposium on Switching Circuit Theory and Logical Design, pp. 133\u2013151. IEEE (1961)","DOI":"10.1109\/FOCS.1961.13"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Corradini, F., Grabmayer, C.A.: A characterization of regular expressions under bisimulation. J. ACM 54(2), 6-es (2007)","DOI":"10.1145\/1219092.1219094"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theor. Comput. Sci. 48, 117\u2013126 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R Cleaveland","year":"1993","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: a semantics-based tool for the verification of concurrent systems. ACM Trans. Program. Lang. Syst. (TOPLAS) 15(1), 36\u201372 (1993)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Sims, S.T.: Generic tools for verifying concurrent systems. Sci. Comput. Program. 42(1), 39\u201347 (2002). Special Issue on Engineering Automation for Computer Based Systems","DOI":"10.1016\/S0167-6423(01)00033-8"},{"key":"7_CR7","volume-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"RL Constable","year":"1986","unstructured":"Constable, R.L., et al.: Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs (1986)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-36742-7_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Cranen","year":"2013","unstructured":"Cranen, S., et al.: An overview of the mCRL2 toolset and its recent advances. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 199\u2013213. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_15"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10009-012-0244-z","volume":"15","author":"H Garavel","year":"2013","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2011: a toolbox for the construction and analysis of distributed processes. Int. J. Softw. Tools Technol. Transfer 15(2), 89\u2013107 (2013)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Grabmayer, C.: Milner\u2019s proof system for regular expressions modulo bisimilarity is complete. In: Symposium on Logic in Computer Science (2022, to appear)","DOI":"10.1145\/3531130.3532430"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BFb0035774","volume-title":"Automata, Languages and Programming","author":"JF Groote","year":"1989","unstructured":"Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 423\u2013438. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035774"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Rauch Henzinger, M., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 453\u2013462. IEEE (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"key":"7_CR13","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman (2006)"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86(1), 43\u201368 (1990)","journal-title":"Inf. Comput."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3\u201341. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28(3), 439\u2013466 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR18","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Technical report, Aarhus University, Denmark (1981)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2004.03.009","volume":"60","author":"GD Plotkin","year":"2004","unstructured":"Plotkin, G.D.: The origins of structural operational semantics. J. Logic Algebraic Program. 60, 3\u201315 (2004)","journal-title":"J. Logic Algebraic Program."},{"key":"7_CR20","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2013","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage Learning, Boston (2013)","edition":"3"},{"issue":"6","key":"7_CR21","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Programming techniques: regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968)","journal-title":"Commun. ACM"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-17945-3_13","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"R van Glabbeek","year":"1987","unstructured":"van Glabbeek, R., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 224\u2013242. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17945-3_13"}],"container-title":["Lecture Notes in Computer Science","A Journey from Process Algebra via Timed Automata to Model Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15629-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T15:42:51Z","timestamp":1728056571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15629-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031156281","9783031156298"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15629-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}