{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:16:02Z","timestamp":1760202962351,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518301"},{"type":"electronic","value":"9783030518318"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-51831-8_8","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T23:05:05Z","timestamp":1593471905000},"page":"153-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Study on Team Bisimulations for BPP Nets"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Gorrieri","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-54152-7_71","volume-title":"PARLE \u201991 Parallel Architectures and Languages Europe","author":"C Autant","year":"1991","unstructured":"Autant, C., Belmesk, Z., Schnoebelen, P.: Strong bisimilarity on nets revisited. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol. 506, pp. 295\u2013312. Springer, Heidelberg (1991). \nhttps:\/\/doi.org\/10.1007\/3-540-54152-7_71"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","volume":"55","author":"E Best","year":"1987","unstructured":"Best, E., Devillers, R.: Sequential and concurrent behavior in Petri net theory. Theor. Comput. Sci. 55(1), 87\u2013136 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01178506","volume":"28","author":"E Best","year":"1991","unstructured":"Best, E., Devillers, R., Kiehn, A., Pomello, L.: Concurrent bisimulations in Petri nets. Acta Informatica 28(3), 231\u2013264 (1991). \nhttps:\/\/doi.org\/10.1007\/BF01178506","journal-title":"Acta Informatica"},{"key":"8_CR4","unstructured":"Christensen, S.: Decidability and decomposition in process algebra. Ph.D. Thesis, University of Edinburgh (1993)"},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Informatica 28(6), 575\u2013591 (1991). \nhttps:\/\/doi.org\/10.1007\/BF01463946","journal-title":"Acta Informatica"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.ic.2009.06.001","volume":"208","author":"S Fr\u00f6schle","year":"2010","unstructured":"Fr\u00f6schle, S., Janc\u0306ar, P., Lasota, S., Sawa, Z.: Non-interleaving bisimulation equivalences on basic parallel processes. Inf. Comput. 208(1), 42\u201362 (2010)","journal-title":"Inf. Comput."},{"key":"8_CR7","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). \nhttps:\/\/doi.org\/10.1007\/3-540-17945-3_13"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical Foundations of Computer Science 1989","author":"R van Glabbeek","year":"1989","unstructured":"van Glabbeek, R., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol. 379, pp. 237\u2013248. Springer, Heidelberg (1989). \nhttps:\/\/doi.org\/10.1007\/3-540-51486-4_71"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-23506-6_9","volume-title":"Correct System Design","author":"RJ Glabbeek","year":"2015","unstructured":"Glabbeek, R.J.: Structure preserving bisimilarity, supporting an operational petri net semantics of CCSP. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 99\u2013130. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23506-6_9"},{"issue":"2\u20133","key":"8_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","volume":"57","author":"U Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Inf. Control 57(2\u20133), 125\u2013147 (1983)","journal-title":"Inf. Control"},{"key":"8_CR11","series-title":"EATCS Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21491-7","volume-title":"Introduction to Concurrency Theory: Transition Systems and CCS","author":"R Gorrieri","year":"2015","unstructured":"Gorrieri, R., Versari, C.: Introduction to Concurrency Theory: Transition Systems and CCS. EATCS Texts in Theoretical Computer Science. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21491-7"},{"key":"8_CR12","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55559-1","volume-title":"Process Algebras for Petri Nets: The Alphabetization of Distributed Systems","author":"R Gorrieri","year":"2017","unstructured":"Gorrieri, R.: Process Algebras for Petri Nets: The Alphabetization of Distributed Systems. EATCS Monographs in Theoretical Computer Science. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-55559-1"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Gorrieri, R.: Team bisimilarity, and its associated modal logic, for BPP nets. Acta Informatica. to appear. \nhttps:\/\/doi.org\/10.1007\/s00236-020-00377-4","DOI":"10.1007\/s00236-020-00377-4"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Gorrieri, R.: Interleaving vs true concurrency: some instructive security examples. In: Janicki, R., et al. (eds.) Petri Nets 2020. LNCS, vol. 12152, pp. xx\u2013yy. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-51831-8_7"},{"key":"8_CR15","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Upper Saddle River (1989)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13(1), 85\u2013108 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR17","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526589","volume-title":"Nets, Terms and Formulas","author":"ER Olderog","year":"1991","unstructured":"Olderog, E.R.: Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science, vol. 23. Cambridge University Press, Cambridge (1991)"},{"key":"8_CR18","volume-title":"Petri Net Theory and the Modeling of Systems","author":"JL Peterson","year":"1981","unstructured":"Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall, Upper Saddle River (1981)"},{"issue":"6","key":"8_CR19","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987). \nhttps:\/\/doi.org\/10.1007\/3-540-17906-2_31"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51831-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T00:05:35Z","timestamp":1593475535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51831-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518301","9783030518318"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51831-8_8","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":"30 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","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":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf-2020.petrinet.net\/","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":"56","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":"23","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":"41% - 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.89","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}