{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:28Z","timestamp":1760202808835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030435196"},{"type":"electronic","value":"9783030435202"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-43520-2_6","type":"book-chapter","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T23:08:28Z","timestamp":1585696108000},"page":"82-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generating Posets Beyond N"],"prefix":"10.1007","author":[{"given":"Uli","family":"Fahrenberg","sequence":"first","affiliation":[]},{"given":"Christian","family":"Johansen","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[]},{"given":"Ratan","family":"Bahadur\u00a0Thapa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,1]]},"reference":[{"issue":"1&2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(95)00230-8","volume":"163","author":"SL Bloom","year":"1996","unstructured":"Bloom, S.L., \u00c9sik, Z.: Free shuffle algebras in language varieties. Theoret. Comput. Sci. 163(1&2), 55\u201398 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR2","unstructured":"Burmeister, P.: Lecture notes on universal algebras, many sorted algebras (2002). https:\/\/www2.mathematik.tu-darmstadt.de\/Math-Net\/Lehrveranstaltungen\/Lehrmaterial\/SS2002\/AllgemeineAlgebra\/download\/LNPartAlg.pdf"},{"key":"6_CR3","volume-title":"Regular Algebra and Finite Machines","author":"JH Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)"},{"key":"6_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. Cambridge University Press, Cambridge (2012)"},{"key":"6_CR5","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Thapa, R.B.: Generating posets beyond N. CoRR, abs\/1910.06162 (2019)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-38164-5_4","volume-title":"Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky","author":"M Fiore","year":"2013","unstructured":"Fiore, M., Devesas Campos, M.: The algebra of directed acyclic graphs. In: Coecke, B., Ong, L., Panangaden, P. (eds.) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. LNCS, vol. 7860, pp. 37\u201351. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38164-5_4"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psych. 7(1), 144\u2013149 (1970)","journal-title":"J. Math. Psych."},{"key":"6_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90042-1","volume-title":"Interval Orders and Interval Graphs: A Study of Partially Ordered Sets","author":"PC Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs: A Study of Partially Ordered Sets. Wiley, New York (1985)"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"30:1","DOI":"10.1145\/2785967","volume":"16","author":"H Furusawa","year":"2015","unstructured":"Furusawa, H., Struth, G.: Concurrent dynamic algebra. ACM Trans. Comput. Log. 16(4), 30:1\u201330:38 (2015)","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"JL Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theoret. Comput. Sci. 61, 199\u2013224 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"6_CR12","first-page":"427","volume":"4","author":"J Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fund. Inf. 4(2), 427 (1981)","journal-title":"Fund. Inf."},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"6","key":"6_CR14","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. Log. Algebr. Program. 80(6), 266\u2013296 (2011)","journal-title":"J. Log. Algebr. Program."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-06251-8_1","volume-title":"Relational and Algebraic Methods in Computer Science","author":"T Hoare","year":"2014","unstructured":"Hoare, T., et al.: Developments in concurrent Kleene algebra. In: H\u00f6fner, P., Jipsen, P., Kahl, W., M\u00fcller, M.E. (eds.) RAMICS 2014. LNCS, vol. 8428, pp. 1\u201318. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06251-8_1"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-91268-4_13","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"R Janicki","year":"2018","unstructured":"Janicki, R.: Modeling operational semantics with interval orders represented by sequences of antichains. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 251\u2013271. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_13"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(93)90238-O","volume":"112","author":"R Janicki","year":"1993","unstructured":"Janicki, R., Koutny, M.: Structure of concurrency. Theoret. Comput. Sci. 112(1), 5\u201352 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ic.2016.12.009","volume":"253","author":"R Janicki","year":"2017","unstructured":"Janicki, R., Yin, X.: Modeling concurrency with interval traces. Inf. Comput. 253, 78\u2013108 (2017)","journal-title":"Inf. Comput."},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.jlamp.2015.12.005","volume":"85","author":"P Jipsen","year":"2016","unstructured":"Jipsen, P., Moshier, M.A.: Concurrent Kleene algebra with tests and branching automata. J. Log. Algebr. Meth. Program. 85(4), 637\u2013652 (2016)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"6_CR20","unstructured":"Kapp\u00e9, T., Brunet, P., Rot, J., Silva, A., Wagemaker, J., Zanasi, F.: Kleene algebra with observations. In: CONCUR 2019, vol. 140 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1007\/978-3-319-89884-1_30","volume-title":"Programming Languages and Systems","author":"T Kapp\u00e9","year":"2018","unstructured":"Kapp\u00e9, T., Brunet, P., Silva, A., Zanasi, F.: Concurrent Kleene algebra: free model and completeness. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 856\u2013882. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_30"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: part I - a theory of interprocess communication. J. ACM 33(2), 313\u2013326 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication, part I: basic formalism. Distrib. Comput. 1(2), 77\u201385 (1986)","journal-title":"Distrib. Comput."},{"key":"6_CR24","volume-title":"Categories for the Working Mathematician","author":"SM Lane","year":"1998","unstructured":"Lane, S.M.: Categories for the Working Mathematician, 2nd edn. Springer, New York (1998)","edition":"2"},{"key":"6_CR25","unstructured":"Laurence, M.R., Struth, G.: Completeness theorems for pomset languages and concurrent Kleene algebras. CoRR, abs\/1705.05896 (2017)"},{"key":"6_CR26","first-page":"141","volume":"36","author":"FW Levi","year":"1944","unstructured":"Levi, F.W.: On semigroups. Bull. Calcutta Math. Soc. 36, 141\u2013146 (1944)","journal-title":"Bull. Calcutta Math. Soc."},{"issue":"1\u20132","key":"6_CR27","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoret. Comput. Sci. 237(1\u20132), 347\u2013380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Mimram, S.: Presenting finite posets. In: TERMGRAPH 2014, vol. 183 of EPTCS (2014)","DOI":"10.4204\/EPTCS.183.1"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-19797-5_1","volume-title":"Mathematics of Program Construction","author":"B M\u00f6ller","year":"2015","unstructured":"M\u00f6ller, B., Hoare, T.: Exploring an interface model for CKA. In: Hinze, R., Voigtl\u00e4nder, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 1\u201329. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19797-5_1"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-52228-9_1","volume-title":"Unifying Theories of Programming","author":"B M\u00f6ller","year":"2017","unstructured":"M\u00f6ller, B., Hoare, T., M\u00fcller, M.E., Struth, G.: A discrete geometric model of concurrent program execution. In: Bowen, J.P., Zhu, H. (eds.) UTP 2016. LNCS, vol. 10134, pp. 1\u201325. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52228-9_1"},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/23005.23008","volume":"34","author":"D Peleg","year":"1987","unstructured":"Peleg, D.: Concurrent dynamic logic. J. ACM 34(2), 450\u2013479 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"6_CR32","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."},{"key":"6_CR33","unstructured":"van Glabbeek, R.J.: The refinement theorem for ST-bisimulation semantics. In: IFIP TC2 Working Conference on Programming Concepts and Methods, North-Holland (1990)"},{"key":"6_CR34","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"},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01798961","volume":"4","author":"W Vogler","year":"1991","unstructured":"Vogler, W.: Failures semantics based on interval semiwords is a congruence for refinement. Distrib. Comput. 4, 139\u2013162 (1991)","journal-title":"Distrib. Comput."},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","year":"1992","unstructured":"Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55767-9"},{"key":"6_CR37","first-page":"441","volume":"17","author":"N Wiener","year":"1914","unstructured":"Wiener, N.: A contribution to the theory of relative position. Proc. Camb. Philos. Soc. 17, 441\u2013449 (1914)","journal-title":"Proc. Camb. Philos. Soc."},{"issue":"4","key":"6_CR38","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0020-0190(77)90021-7","volume":"6","author":"J Winkowski","year":"1977","unstructured":"Winkowski, J.: An algebraic characterization of the behaviour of non-sequential systems. Inf. Process. Lett. 6(4), 105\u2013109 (1977)","journal-title":"Inf. Process. Lett."}],"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-030-43520-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:02:46Z","timestamp":1709665366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-43520-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030435196","9783030435202"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43520-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 April 2020","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":"Palaiseau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ramics18.gforge.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"29","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":"20","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":"69% - 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":"4","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":"3","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}