{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:40:06Z","timestamp":1749422406222,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030780883"},{"type":"electronic","value":"9783030780890"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-78089-0_5","type":"book-chapter","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T14:26:35Z","timestamp":1623248795000},"page":"80-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Gorrieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,8]]},"reference":[{"key":"5_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). https:\/\/doi.org\/10.1007\/3-540-54152-7_71"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T Basten","year":"1996","unstructured":"Basten, T.: Branching bisimilarity is an equivalence indeed!. Inf. Process. Lett. 58(3), 141\u2013147 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"5_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 Inf. 28(3), 231\u2013264 (1991)","journal-title":"Acta Inf."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-65306-6_15","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Desel","year":"1998","unstructured":"Desel, J., Reisig, W.: Place\/transition petri nets. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 122\u2013173. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_15"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems \u2014 an introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996)","journal-title":"J. ACM"},{"key":"5_CR7","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). https:\/\/doi.org\/10.1007\/978-3-319-23506-6_9"},{"key":"5_CR8","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21491-7","volume-title":"Introduction to Concurrency Theory","author":"R Gorrieri","year":"2015","unstructured":"Gorrieri, R., Versari, C.: Introduction to Concurrency Theory. TTCSAES. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21491-7"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Gorrieri, R.: Process Algebras for Petri Nets: The Alphabetization of Distributed Systems. EATCS Monographs in Computer Science, Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-55559-1","DOI":"10.1007\/978-3-319-55559-1"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Gorrieri, R.: Team bisimilarity, and its associated modal logic, for BPP nets. Acta Informatica 1\u201341 (2020). https:\/\/doi.org\/10.1007\/s00236-020-00377-4","DOI":"10.1007\/s00236-020-00377-4"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Gorrieri, R.: Team equivalences for finite-state machines with silent moves. Inf. Comput. 275 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104603","DOI":"10.1016\/j.ic.2020.104603"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gorrieri, R.: Causal semantics for BPP nets with silent moves. Fundam. Inform. (2020, to appear)","DOI":"10.3233\/FI-2021-2039"},{"key":"5_CR13","unstructured":"Gorrieri, R.: Place bisimilarity is decidable, indeed!, arXiv:2104.01392, April 2021"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Janc\u0306ar, P.: Undecidability of bisimilarity for Petri nets and some related problems. Theoret. Comput. Sci. 148(2), 281\u2013301 (1995)","DOI":"10.1016\/0304-3975(95)00037-W"},{"issue":"7","key":"5_CR16","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1145\/360248.360251","volume":"19","author":"R Keller","year":"1976","unstructured":"Keller, R.: Formal verification of parallel programs. Commun. ACM 19(7), 561\u2013572 (1976)","journal-title":"Commun. ACM"},{"key":"5_CR17","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall (1989)"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Inf. Comput. 100(1), 1\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Olderog, E.R.: Nets, Terms and Formulas, Cambridge Tracts in Theoretical Computer Science 23. Cambridge University Press (1991)","DOI":"10.1017\/CBO9780511526589"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0017309"},{"key":"5_CR21","unstructured":"Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall (1981)"},{"key":"5_CR22","unstructured":"Pinchinat, S.: Des bisimulations pour la s\u00e9mantique des syst\u00e8mes r\u00e9actifs, G\u00e9nie logiciel [cs.SE]. Ph.D. thesis, Institut National Polytechnique de Grenoble - INPG (1993)"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Reisig, W.: Petri Nets: An Introduction, EATCS Monographs in Theoretical Computer Science, Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-69968-9","DOI":"10.1007\/978-3-642-69968-9"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$-calculus: A Theory of Mobile Processes. Cambridge University Press (2001)","DOI":"10.1017\/9781316134924"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78089-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:03:29Z","timestamp":1749420209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78089-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030780883","9783030780890"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78089-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valletta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","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":"14 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","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":"forte2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2021\/forte","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":"26","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":"9","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":"4","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":"35% - 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":"2","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":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}