iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/978-3-031-62076-8_14
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T19:53:14Z","timestamp":1726257194372},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031620751"},{"type":"electronic","value":"9783031620768"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62076-8_14","type":"book-chapter","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T09:02:35Z","timestamp":1716886955000},"page":"218-237","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Model Checking Reversible Systems: Forwardly"],"prefix":"10.1007","author":[{"given":"Federico","family":"Dal Pio Luogo","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1556-2623","authenticated-orcid":false,"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8911-1580","authenticated-orcid":false,"given":"G. Michele","family":"Pinna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"volume-title":"Principles of Model Checking","year":"2008","author":"C Baier","key":"14_CR1","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398\u2013412. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_31"},{"issue":"6","key":"14_CR4","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)","journal-title":"Acta Informatica"},{"key":"14_CR5","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77426-6","volume-title":"Unfoldings - A Partial-Order Approach to Model Checking","author":"J Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Monographs in Theoretical Computer Science. An EATCS Series, Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77426-6"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10626-006-0001-0","volume":"17","author":"E Fabre","year":"2007","unstructured":"Fabre, E.: Trellis processes: a compact representation for runs of concurrent systems. Discrete Event Dyn. Syst. 17(3), 267\u2013306 (2007)","journal-title":"Discrete Event Dyn. Syst."},{"key":"14_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-51803-7_36","volume-title":"Temporal Logic in Specification","author":"DM Gabbay","year":"1989","unstructured":"Gabbay, D.M.: The declarative past and imperative future: executable temporal logic for interactive systems. In: Banieqbal, B., Barringer, H., Pnueli, A. (eds.) Temporal Logic in Specification. LNCS, vol. 398, pp. 409\u2013448. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51803-7_36"},{"key":"14_CR8","unstructured":"Geatti, L., Gigante, N., Montanari, A., Venturato, G.: Past matters: supporting LTL+past in the BLACK satisfiability checker. In: TIME 2021. LIPIcs, vol. 206. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Gerth, R., Peled, D.A., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Protocol Specification, Testing and Verification XV. IFIP Conference Proceedings, vol. 38. Chapman & Hall (1995)","DOI":"10.1007\/978-0-387-34892-6_1"},{"key":"14_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-54804-8_26","volume-title":"FASE 2014","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 370\u2013384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54804-8_26"},{"issue":"2\/3","key":"14_CR11","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 behavior of Petri nets. Inf. Control 57(2\/3), 125\u2013147 (1983)","journal-title":"Inf. Control"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00236-003-0122-y","volume":"40","author":"V Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of Petri net unfoldings. Acta Informatica 40(2), 95\u2013118 (2003)","journal-title":"Acta Informatica"},{"key":"14_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"ESOP 2013","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 370\u2013390. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_21"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.02.019","volume":"625","author":"I Lanese","year":"2016","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversibility in the higher-order $$\\pi $$-calculus. Theor. Comput. Sci. 625, 25\u201384 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-030-79837-6_8","volume-title":"RC 2021","author":"I Lanese","year":"2021","unstructured":"Lanese, I., Phillips, I.: Forward-reverse observational equivalences in CCSK. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 126\u2013143. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_8"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/MITP.2021.3117920","volume":"24","author":"I Lanese","year":"2022","unstructured":"Lanese, I., Schultz, U.P., Ulidowski, I.: Reversible computing in debugging of Erlang programs. IT Prof. 24(1), 74\u201380 (2022)","journal-title":"IT Prof."},{"key":"14_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume-title":"Logics of Programs","author":"O Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Parikh, R. (ed.) Logics of Programs. LNCS, vol. 193, pp. 196\u2013218. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-15648-8_16"},{"key":"14_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-56496-9_14","volume-title":"CAV 1992","author":"KL McMillan","year":"1993","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: von Bochmann, G., Probst, D.K. (eds.) CAV 1992. LNCS, vol. 663, pp. 164\u2013177. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56496-9_14"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Melgratti, H.C., Mezzina, C.A., Pinna, G.M.: A distributed operational view of reversible prime event structures. In: LICS 2021. IEEE (2021)","DOI":"10.1109\/LICS52264.2021.9470623"},{"key":"14_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-031-35355-0_13","volume-title":"FORTE 2023","author":"HC Melgratti","year":"2023","unstructured":"Melgratti, H.C., Mezzina, C.A., Pinna, G.M.: Relating reversible petri nets and reversible event structures, categorically. In: Huisman, M., Ravara, A. (eds.) FORTE 2023. LNCS, vol. 13910, pp. 206\u2013223. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35355-0_13"},{"key":"14_CR21","unstructured":"Melgratti, H.C., Mezzina, C.A., Ulidowski, I.: Reversing place transition nets. Log. Methods Comput. Sci. 16(4), 5:1\u20135:28 (2020)"},{"key":"14_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-031-35361-1_11","volume-title":"COORDINATION 2023","author":"CA Mezzina","year":"2023","unstructured":"Mezzina, C.A., Tiezzi, F., Yoshida, N.: Rollback recovery in session-based programming. In: Jongmans, S.S., Lopes, A. (eds.) COORDINATION 2023. LNCS, vol. 13908, pp. 195\u2013213. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35361-1_11"},{"key":"14_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2021.100718","volume":"124","author":"A Philippou","year":"2022","unstructured":"Philippou, A., Psara, K.: Reversible computation in nets with bonds. J. Log. Algebraic Methods Program. 124, 100718 (2022)","journal-title":"J. Log. Algebraic Methods Program."},{"issue":"2","key":"14_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0960129511000429","volume":"22","author":"I Phillips","year":"2012","unstructured":"Phillips, I., Ulidowski, I.: A hierarchy of reverse bisimulations on stable configuration structures. Math. Struct. Comput. Sci. 22(2), 333\u2013372 (2012)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"14_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129513000510","volume":"24","author":"I Phillips","year":"2014","unstructured":"Phillips, I., Ulidowski, I.: Event identifier logic. Math. Struct. Comput. Sci. 24(2), e240204 (2014)","journal-title":"Math. Struct. Comput. Sci."},{"key":"14_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"RC 2012","author":"I Phillips","year":"2012","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218\u2013232. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_18"},{"issue":"1\u20132","key":"14_CR27","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"ICC Phillips","year":"2007","unstructured":"Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebraic Methods Program. 73(1\u20132), 70\u201396 (2007)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"14_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-73359-3_16","volume-title":"CMC 2017","author":"GM Pinna","year":"2017","unstructured":"Pinna, G.M.: Reversing steps in membrane systems computations. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) CMC 2017. LNCS, vol. 10725, pp. 245\u2013261. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-73359-3_16"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Schordan, M., Oppelstrup, T., Jefferson, D.R., Barnes Jr., P.D.: Generation of reversible C++ code for optimistic parallel discrete event simulation. New Gener. Comput. 36(3), 257\u2013280 (2018)","DOI":"10.1007\/s00354-018-0038-2"},{"issue":"3","key":"14_CR30","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00354-018-0040-8","volume":"36","author":"I Ulidowski","year":"2018","unstructured":"Ulidowski, I., Phillips, I., Yuen, S.: Reversing event structures. New Gener. Comput. 36(3), 281\u2013306 (2018)","journal-title":"New Gener. Comput."},{"key":"14_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-99498-7_20","volume-title":"RC 2018","author":"M Vassor","year":"2018","unstructured":"Vassor, M., Stefani, J.-B.: Checkpoint\/rollback vs causally-consistent reversibility. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 286\u2013303. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_20"},{"key":"14_CR32","series-title":"LNCS","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":"1986","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-17906-2_31"},{"issue":"3","key":"14_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629680","volume":"15","author":"M Ying","year":"2014","unstructured":"Ying, M., Li, Y., Yu, N., Feng, Y.: Model-checking linear-time properties of quantum systems. ACM Trans. Comput. Log. 15(3), 1\u201331 (2014)","journal-title":"ACM Trans. Comput. Log."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62076-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T09:04:46Z","timestamp":1716887086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62076-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031620751","9783031620768"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62076-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toru\u0144","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","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":"rc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rc2024.mat.umk.pl\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}