{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:31:56Z","timestamp":1759336316679,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031426254"},{"type":"electronic","value":"9783031426261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-42626-1_7","type":"book-chapter","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T14:05:02Z","timestamp":1693231502000},"page":"105-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Local-Time Semantics for\u00a0Negotiations"],"prefix":"10.1007","author":[{"given":"Madhavan","family":"Mukund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2521-1697","authenticated-orcid":false,"given":"Adwitee","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2666-0691","authenticated-orcid":false,"given":"B.","family":"Srivathsan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Akshay, S., Genest, B., H\u00e9lou\u00ebt, L., Mital, S.: Timed negotiations. In: Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2020, Dublin, 25\u201330 April 2020, pp. 37\u201356 (2020)","key":"7_CR1","DOI":"10.1007\/978-3-030-45231-5_3"},{"doi-asserted-by":"crossref","unstructured":"Akshay, S., Mukund, M., Narayan Kumar, K.: Checking coverage for infinite collections of timed scenarios. In: Proceedings of the 18th International Conference on Concurrency Theory, CONCUR 2007, Lisbon, 3\u20138 September 2007, pp. 181\u2013196 (2007)","key":"7_CR2","DOI":"10.1007\/978-3-540-74407-8_13"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Bengtsson, J., Jonsson, B., Lilius, J., Yi, W.: Partial order reductions for timed systems. In: Proceedings of the 9th International Conference on Concurrency Theory, CONCUR 1998, Nice, 8\u201311 September 1998, pp. 485\u2013500 (1998)","key":"7_CR4","DOI":"10.1007\/BFb0055643"},{"doi-asserted-by":"publisher","unstructured":"Bouyer, P., Haddad, S., Reynier, P.-A.: Timed unfoldings for networks of timed automata. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 292\u2013306. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11901914_23","key":"7_CR5","DOI":"10.1007\/11901914_23"},{"doi-asserted-by":"publisher","unstructured":"Cassez, F., Chatain, T., Jard, C.: Symbolic unfoldings for networks of timed automata. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 307\u2013321. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11901914_24","key":"7_CR6","DOI":"10.1007\/11901914_24"},{"doi-asserted-by":"publisher","unstructured":"Chatain, T., Jard, C.: Time supervision of concurrent systems using symbolic unfoldings of time petri nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 196\u2013210. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11603009_16","key":"7_CR7","DOI":"10.1007\/11603009_16"},{"doi-asserted-by":"publisher","unstructured":"Chatain, T., Jard, C.: Complete finite prefixes of symbolic unfoldings of safe time petri nets. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol. 4024, pp. 125\u2013145. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11767589_8","key":"7_CR8","DOI":"10.1007\/11767589_8"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00236-018-0318-9","volume":"56","author":"J Desel","year":"2019","unstructured":"Desel, J., Esparza, J., Hoffmann, P.: Negotiation as concurrency primitive. Acta Informatica 56(2), 93\u2013159 (2019)","journal-title":"Acta Informatica"},{"doi-asserted-by":"crossref","unstructured":"Esparza, J., Desel, J.: On negotiation as concurrency primitive. In: Proceedings of the 24th International Conference on Concurrency Theory, CONCUR 2013, Buenos Aires, Argentina, 27\u201330 August 2013, pp. 440\u2013454 (2013)","key":"7_CR10","DOI":"10.1007\/978-3-642-40184-8_31"},{"doi-asserted-by":"crossref","unstructured":"Esparza, J., Kuperberg, D., Muscholl, A., Walukiewicz, I.: Soundness in negotiations. Log. Methods Comput. Sci. 14(1) (2018)","key":"7_CR11","DOI":"10.1109\/LICS.2017.8005144"},{"doi-asserted-by":"crossref","unstructured":"Esparza, J., Muscholl, A., Walukiewicz, I.: Static analysis of deterministic negotiations. In: Proceedings of the 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, 20\u201323 June 2017, pp. 1\u201312 (2017)","key":"7_CR12","DOI":"10.1109\/LICS.2017.8005144"},{"unstructured":"Govind, R., Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Revisiting local time semantics for networks of timed automata. In: Proceedings of the 30th International Conference on Concurrency Theory, CONCUR 2019, Amsterdam, 27\u201330 August 2019, pp. 16:1\u201316:15 (2019)","key":"7_CR13"},{"doi-asserted-by":"crossref","unstructured":"Govind, R., Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. In: Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2022, Haifa, 2\u20135 August 2022, pp. 24:1\u201324:14 (2022)","key":"7_CR14","DOI":"10.1145\/3531130.3533343"},{"doi-asserted-by":"crossref","unstructured":"Hanisch, H.-M.: Analysis of place\/transition nets with timed arcs and its application to batch process control. In: Proceedings of the 14th International Conference on Application and Theory of Petri Nets 1993, Chicago, 21\u201325 June 1993, pp. 282\u2013299 (1993)","key":"7_CR15","DOI":"10.1007\/3-540-56863-8_52"},{"unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Checking timed b\u00fcchi automata emptiness using the local-time semantics. In: Proceedings of the 33rd International Conference on Concurrency Theory, CONCUR 2022, Warsaw, 12\u201316 September 2022, pp. 12:1\u201312:24 (2022)","key":"7_CR16"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2005.07.023","volume":"345","author":"D Lugiez","year":"2005","unstructured":"Lugiez, D., Niebert, P., Zennou, S.: A partial order semantics approach to the clock explosion problem of timed automata. Theor. Comput. Sci. 345(1), 27\u201359 (2005)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Merlin, P.M.: A Study of the Recoverability of Computing Systems. Ph.D. thesis, University of California, Irvine (1974). AAI7511026","key":"7_CR18"},{"doi-asserted-by":"crossref","unstructured":"Mukund, M., Roy, A., Srivathsan, B.: A local-time semantics for negotiations. arXiv preprint arXiv:2307.06691 (2023)","key":"7_CR19","DOI":"10.1007\/978-3-031-42626-1_7"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42626-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T23:34:10Z","timestamp":1729985650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42626-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031426254","9783031426261"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42626-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Antwerp","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uantwerpen.be\/en\/conferences\/confest-2023\/","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":"21","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":"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":"43% - 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.143","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.063","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)"}}]}}