{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:30:35Z","timestamp":1742963435686,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030769826"},{"type":"electronic","value":"9783030769833"}],"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-76983-3_4","type":"book-chapter","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:06:10Z","timestamp":1623798370000},"page":"55-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Timed Petri Nets with Reset for Pipelined Synchronous Circuit Design"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Parrot","sequence":"first","affiliation":[]},{"given":"Mika\u00ebl","family":"Briday","sequence":"additional","affiliation":[]},{"given":"Olivier H.","family":"Roux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"issue":"4","key":"4_CR1","first-page":"419","volume":"89","author":"PA Abdulla","year":"2008","unstructured":"Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for one-clock timed automata. Fundam. Informaticae 89(4), 419\u2013450 (2008)","journal-title":"Fundam. Informaticae"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Inf. Comput. 104(1), 2\u201334 (1993)","journal-title":"Inf. Comput."},{"issue":"2","key":"4_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. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.12.005","volume":"474","author":"B B\u00e9rard","year":"2013","unstructured":"B\u00e9rard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: The expressive power of time Petri nets. Theoretical Comput. Sci. (TCS) 474, 1\u201320 (2013)","journal-title":"Theoretical Comput. Sci. (TCS)"},{"issue":"6","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1093\/logcom\/exp036","volume":"19","author":"H Boucheneb","year":"2009","unstructured":"Boucheneb, H., Gardey, G., Roux, O.H.: TCTL model checking of time Petri nets. J. Log. Comput. 19(6), 1509\u20131540 (2009)","journal-title":"J. Log. Comput."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bufistov, D., Cortadella, J., Kishinevsky, M., Sapatnekar, S.: A general model for performance optimization of sequential systems. In: 2007 IEEE\/ACM International Conference on Computer-Aided Design, pp. 362\u2013369 (2007)","DOI":"10.1109\/ICCAD.2007.4397291"},{"issue":"5","key":"4_CR7","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/81.139289","volume":"39","author":"J Campos","year":"1992","unstructured":"Campos, J., Chiola, G., Colom, J.M., Silva, M.: Properties and performance bounds for timed marked graphs. IEEE Trans. Circuits Syst. I: Fund. Theory Appl. 39(5), 386\u2013401 (1992)","journal-title":"IEEE Trans. Circuits Syst. I: Fund. Theory Appl."},{"key":"4_CR8","unstructured":"Carloni, L.P., McMillan, K.L., Saldanha, A., Sangiovanni-Vincentelli, A.L.: A methodology for correct-by-construction latency insensitive design. In: 1999 IEEE\/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051), pp. 309\u2013315 (1999)"},{"issue":"10","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.jss.2005.12.021","volume":"79","author":"F Cassez","year":"2006","unstructured":"Cassez, F., Roux, O.H.: Structural translation from Time Petri Nets to Timed Automata - Model-Checking Time Petri Nets via Timed Automata. J. Syst. Softw. 79(10), 1456\u20131468 (2006)","journal-title":"J. Syst. Softw."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theoret. Comput. Sci. 147, 117\u2013136 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR11","unstructured":"Church, A.: Application of recursive arithmetic to the problem of circuit synthesis, pp. 3\u201350 (1957)"},{"key":"4_CR12","unstructured":"Giua, A., DiCesare, F., Silva, M.: Generalized mutual exclusion constraints on nets with uncontrollable transitions. In: IEEE International Conference on SMC (1992)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Istoan, M., \u00a0de\u00a0Dinechin, F.: Automating the pipeline of arithmetic datapaths. In: Design, Automation & Test in Europe Conference & Exhibition (DATE 2017), pp. 704\u2013709, Lausanne, Switzerland (2017)","DOI":"10.23919\/DATE.2017.7927080"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Josipovi\u0107, L., Sheikhha, S., Guerrieri, A., Ienne, P., Cortadella, J.: Buffer placement and sizing for high-performance dataflow circuits. In: Proceedings of the 2020 ACM\/SIGDA Int. Symposium on Field-Programmable Gate Arrays, FPGA 2020, pp. 186\u2013196. Association for Computing Machinery, New York (2020)","DOI":"10.1145\/3373087.3375314"},{"issue":"1\u20136","key":"4_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01759032","volume":"6","author":"CE Leiserson","year":"1991","unstructured":"Leiserson, C.E., Saxe, J.B.: Retiming synchronous circuitry. Algorithmica 6(1\u20136), 5\u201335 (1991)","journal-title":"Algorithmica"},{"key":"4_CR16","unstructured":"Merlin, P.M.: A study of the recoverability of computing systems. Ph.D. thesis, Dep. of Information and Computer Science, University of California, Irvine, CA (1974)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Najibi, M., Beerel, P.A.: Slack matching mode-based asynchronous circuits for average-case performance. In: Proceedings of the International Conference on Computer-Aided Design, ICCAD 2013, pp. 219\u2013225. IEEE Press (2013)","DOI":"10.1109\/ICCAD.2013.6691122"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004, pp. 54\u201363 (2004)","DOI":"10.1109\/LICS.2004.1319600"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Popova-Zeugmann, L.: Time and Petri Nets. Springer (2013)","DOI":"10.1007\/978-3-642-41115-1"},{"key":"4_CR20","unstructured":"Ramchandani, C.: Analysis of asynchronous concurrent systems by timed Petri nets. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA (1974)"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TCAD.2005.853689","volume":"25","author":"S Kim","year":"2006","unstructured":"Kim, S., Beerel, P.A.: Pipeline optimization for asynchronous circuits: complexity analysis and an efficient optimal algorithm. IEEE Trans. Comput.-Aided Des. Integrated Circuits Syst. 25(3), 389\u20134022 (2006)","journal-title":"IEEE Trans. Comput.-Aided Des. Integrated Circuits Syst."},{"issue":"4","key":"4_CR22","first-page":"331","volume":"4","author":"W Zuberek","year":"1987","unstructured":"Zuberek, W.: D-timed petri nets and modeling of timeouts and protocols. Trans. Soc. Comput. Simul. 4(4), 331\u2013357 (1987)","journal-title":"Trans. Soc. Comput. Simul."}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76983-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:07:40Z","timestamp":1623798460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76983-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030769826","9783030769833"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76983-3_4","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":"16 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lipn.univ-paris13.fr\/petrinets2021\/","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":"39","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":"22","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":"56% - 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":"3","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":"2 keynote papers are also included.","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)"}}]}}