{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:20:40Z","timestamp":1743024040781,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031208331"},{"type":"electronic","value":"9783031208348"}],"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-20834-8_1","type":"book-chapter","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T20:03:58Z","timestamp":1668715438000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Approach to Construct Final Random System with Output"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5865-6158","authenticated-orcid":false,"given":"Artem","family":"Panchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7515-2143","authenticated-orcid":false,"given":"Grygoriy","family":"Zholtkevych","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,18]]},"reference":[{"key":"1_CR1","unstructured":"nLab authors: nLab (2021). https:\/\/ncatlab.org\/nlab\/Revision286"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0304-3975(82)80001-7","volume":"20","author":"H Ehrig","year":"1982","unstructured":"Ehrig, H., Kreowski, H.J., Mahr, B., Padawitz, P.: Algebraic implementation of abstract data types. Theoret. Comput. Sci. 20(3), 209\u2013263 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR3","unstructured":"Gu, T., Zanasi, F.: Coalgebraic semantics for probabilistic logic programming. Logical Methods in Computer Science (2021)"},{"key":"1_CR4","unstructured":"Gumm, H.P.: State based systems are coalgebras. In: Cubo - Matematica Educacional, vol. 5, pp. 239\u2013262 (2003)"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/5.21065","volume":"77","author":"YC Ho","year":"1989","unstructured":"Ho, Y.C.: Introduction to special issue on dynamics of discrete event systems. Proc. IEEE 77(1), 3\u20136 (1989)","journal-title":"Proc. IEEE"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781316823187"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1080\/00029890.1992.11995869","volume":"99","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E.: Two notes on notation. Am. Math. Monthly 99, 403\u2013422 (1992)","journal-title":"Am. Math. Monthly"},{"key":"1_CR8","unstructured":"Milewski, B.: Category Theory for Programmers. Bartosz Milewski (2019)"},{"key":"1_CR9","unstructured":"Moore, G.: No exponential is forever: but \u201cforever\u201d can be delayed! [semiconductor industry]. In: IEEE International Solid-State Circuits Conference. Digest of Technical Papers, ISSCC (2003)"},{"key":"1_CR10","unstructured":"Panchenko, A., Zholtkevych, G.: Coalgebraic understanding of random systems with output. In: Ermolayev, V., et al. (eds.) ICTERI 2021: ICT in Education, Research, and Industrial Applications. CEUR Workshop Proceedings, vol. 3013, pp. 296\u2013306 (2021)"},{"key":"1_CR11","unstructured":"Rutten, J.: The method of coalgebra: exercises in coinduction. In: FM 2019 (2019)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249, 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Smith, D.J.: Methods of modeling, Chap. 8. In: Smith, D.J. (ed.) Reliability, Maintainability and Risk, 9th edn. Butterworth-Heinemann (2017)","DOI":"10.1016\/B978-0-08-102010-4.00008-X"},{"issue":"5","key":"1_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"2","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 2(5), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"key":"1_CR15","unstructured":"Tennent, R.: Semantics of Programming Languages. PHI Series in Computer Science. Prentice Hall, Hoboken (1991)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0960129598002588","volume":"8","author":"D Turi","year":"1998","unstructured":"Turi, D., Rutten, J.J.M.M.: On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Math. Struct. Comput. Sci. 8, 481\u2013540 (1998)","journal-title":"Math. Struct. Comput. Sci."},{"key":"1_CR17","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-030-77592-6_7","volume-title":"Information and Communication Technologies in Education, Research, and Industrial Applications","author":"G Zholtkevych","year":"2021","unstructured":"Zholtkevych, G., Labzhaniia, M.: Coalgebraic approach to studying discrete systems with output. In: Bollin, A., et al. (eds.) ICTERI 2020. CCIS, vol. 1308, pp. 141\u2013165. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77592-6_7"},{"key":"1_CR18","unstructured":"Zholtkevych, G., Labzhaniia, M.: Understanding safety constraints coalgebraically. In: Lytvyn, V., et al. (eds.) Computational Linguistics and Intelligent Systems. CEUR Workshop Proceedings, vol. 2604, pp. 1\u201319 (2020)"}],"container-title":["Communications in Computer and Information Science","Information and Communication Technologies in Education, Research, and Industrial Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20834-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T20:06:23Z","timestamp":1668715583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20834-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031208331","9783031208348"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20834-8_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTERI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kherson","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ukraine","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icteri2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icteri.org\/icteri-2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"24","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":"12","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":"50% - 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":"3","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":"1.6","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)"}}]}}