{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:44:42Z","timestamp":1761767082264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031103629"},{"type":"electronic","value":"9783031103636"}],"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-10363-6_12","type":"book-chapter","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T12:20:21Z","timestamp":1656678021000},"page":"173-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extending Process Algebra with an Undefined Action"],"prefix":"10.1007","author":[{"given":"S.","family":"Arun-Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,3]]},"reference":[{"key":"12_CR1","unstructured":"Arun-Kumar, S.: On bisimilarities induced by relations on actions. In: Proceedings 4th IEEE International Conference on Software Engineering and Formal Methods, Pune, India. IEEE Computer Society Press (2006)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-319-06251-8_13","volume-title":"Relational and Algebraic Methods in Computer Science","author":"S Arun-Kumar","year":"2014","unstructured":"Arun-Kumar, S., Bagga, D.: Parameterised bisimulations: some applications. In: H\u00f6fner, P., Jipsen, P., Kahl, W., M\u00fcller, M.E. (eds.) RAMICS 2014. LNCS, vol. 8428, pp. 208\u2013225. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06251-8_13"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-67729-3_4","volume-title":"Theoretical Aspects of Computing","author":"D Bagga","year":"2017","unstructured":"Bagga, D., Arun-Kumar, S.: Logical characterization of parameterised bisimulations. In: Hung, D., Kapur, D. (eds.) ICTAC 2017. LNCS, vol. 10580, pp. 51\u201369. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67729-3_4"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R De Nicola","year":"1983","unstructured":"De Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theoret. Comput. Sci. 34, 83\u2013133 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR5","volume-title":"Algebraic Theory of Processes","author":"MCB Hennessy","year":"1988","unstructured":"Hennessy, M.C.B.: Algebraic Theory of Processes. MIT Press, Boston (1988)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-31862-0_9","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"N Korade","year":"2005","unstructured":"Korade, N., Arun-Kumar, S.: A logical characterization of efficiency preorders. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 99\u2013112. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31862-0_9"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-10828-9_52","volume-title":"CAAP \u201981","author":"R Milner","year":"1981","unstructured":"Milner, R.: A modal characterisation of observable machine-behaviour. In: Astesiano, E., B\u00f6hm, C. (eds.) CAAP 1981. LNCS, vol. 112, pp. 25\u201334. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10828-9_52"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoret. Comput. Sci. 25, 267\u2013310 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR9","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International (1989)"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"DS Scott","year":"1976","unstructured":"Scott, D.S.: Data types as lattices. SIAM J. Comput. 5(3), 522\u2013587 (1976)","journal-title":"SIAM J. Comput."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Automata, Languages and Programming","author":"DS Scott","year":"1982","unstructured":"Scott, D.S.: Domains for denotational semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 577\u2013610. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0012801"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Walker, D.J.: Bisimulation and divergence in CCS. In: Third Annual Symposium on Logic in Computer Science, pp. 186\u2013192. IEEE Computer Society Press, Edinburgh, July 1988","DOI":"10.1109\/LICS.1988.5117"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10363-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T08:09:27Z","timestamp":1727510967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10363-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031103629","9783031103636"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10363-6_12","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":"3 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tase2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ubbcluj.ro\/tase2022\/","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":"71","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":"21","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":"5","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":"30% - 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":"4","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)"}}]}}