{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T16:30:09Z","timestamp":1775061009583,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032224682","type":"print"},{"value":"9783032224699","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-22469-9_5","type":"book-chapter","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:26Z","timestamp":1775055446000},"page":"77-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Representations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9762-6872","authenticated-orcid":false,"given":"Paul","family":"Brunet","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,2]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Aceto, L., Della Monica, D., F\u00e1bregas, I., Ing\u00f3lfsd\u00f3ttir, A.: When are prime formulae characteristic? Theor. Comput. Sci. 777, 3\u201331 (Jul 2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.12.004","DOI":"10.1016\/j.tcs.2018.12.004"},{"key":"5_CR2","unstructured":"Bird, R., de\u00a0Moor, O.: Algebra Of Programming. No.\u00a0100 in International series in computer science, Prentice Hall (1997)"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Brunet, P., Pous, D.: A formal exploration of nominal kleene algebra. In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a058. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.22","DOI":"10.4230\/LIPIcs.MFCS.2016.22"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Fahrenberg, U., Legay, A.: A linear-time\u2013branching-time spectrum for behavioral specification theories. J. Logical Algebraic Methods Programm. 110 (Jan 2020). https:\/\/doi.org\/10.1016\/j.jlamp.2019.100499","DOI":"10.1016\/j.jlamp.2019.100499"},{"key":"5_CR5","volume-title":"Categories, Allegories","author":"PJ Freyd","year":"1990","unstructured":"Freyd, P.J., \u0160\u010dedrov, A.: Categories, Allegories. North-Holland, North-Holland mathematical library (1990)"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Goguen, J.A., Burstall, R.M.: Institutions: abstract model theory for specification and programming. J. ACM 39(1) (1992). https:\/\/doi.org\/10.1145\/147508.147524","DOI":"10.1145\/147508.147524"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"G\u00f6del, K.: \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatshefte f\u00fcr Mathematik und Physik 38(1) (Dec 1931). https:\/\/doi.org\/10.1007\/BF01700692","DOI":"10.1007\/BF01700692"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Kapp\u00e9, T., Brunet, P., Silva, A., Zanasi, F.: Concurrent kleene algebra: free model and completeness. In: Programming Languages and Systems. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_30","DOI":"10.1007\/978-3-319-89884-1_30"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Kozen, D.: A completeness theorem for kleene algebras and the algebra of regular events. Inform. Comput. 110(2) (May 1994). https:\/\/doi.org\/10.1006\/inco.1994.1037","DOI":"10.1006\/inco.1994.1037"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Kozen, D., Mamouras, K., Silva, A.: Completeness and incompleteness in nominal kleene algebra. In: Relational and Algebraic Methods in Computer Science. Lecture Notes in Computer Science, Springer International Publishing, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24704-5_4","DOI":"10.1007\/978-3-319-24704-5_4"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Kozen, D., Smith, F.: Kleene algebra with tests: completeness and decidability. In: Computer Science Logic. Lecture Notes in Computer Science, Springer Berlin Heidelberg (1997)","DOI":"10.1007\/3-540-63172-0_43"},{"key":"5_CR12","unstructured":"Krob, D.: A complete system of B-rational identities. In: Automata, Languages and Programming. Lecture Notes in Computer Science, Springer Berlin Heidelberg (1990)"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Kurz, A., Velebil, J.: Relation lifting, a survey. J. Logical Algebraic Methods in Programm. 85(4) (Jun 2016). https:\/\/doi.org\/10.1016\/j.jlamp.2015.08.002","DOI":"10.1016\/j.jlamp.2015.08.002"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Laurence, M.R., Struth, G.: Completeness theorems for bi-kleene algebras and series-parallel rational pomset languages. In: Relational and Algebraic Methods in Computer Science. Lecture Notes in Computer Science, Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06251-8_5","DOI":"10.1007\/978-3-319-06251-8_5"},{"key":"5_CR15","unstructured":"Pilling, D.L.: The algebra of operators for regular events. Ph.D. thesis, Cambridge University (1970), phD advisor: John Horton Conway"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Rice, H.G.: Classes of recursively enumerable sets and their decision problems. Trans. American Math. Society 74(2) (1953). https:\/\/doi.org\/10.2307\/1990888","DOI":"10.2307\/1990888"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM 13(1) (1966). https:\/\/doi.org\/10.1145\/321312.321326","DOI":"10.1145\/321312.321326"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Tarski, A.: On the calculus of relations. J. Symbolic Logic 6(3) (Sep 1941). https:\/\/doi.org\/10.2307\/2268577","DOI":"10.2307\/2268577"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Wagemaker, J., Bonsangue, M., Kapp\u00e9, T., Rot, J., Silva, A.: Completeness and incompleteness of synchronous kleene algebra. In: Mathematics of Program Construction. Lecture Notes in Computer Science, Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33636-3_14","DOI":"10.1007\/978-3-030-33636-3_14"}],"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-032-22469-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:28Z","timestamp":1775055448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22469-9_5"}},"subtitle":["A Meta-model for System Analysis"],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032224682","9783032224699"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22469-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 April 2026","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":"B\u0119dlewo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}