{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:13Z","timestamp":1750306333236,"version":"3.41.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T00:00:00Z","timestamp":1482105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR national research program","award":["ANR-14-CE28-0002 PACS (P Analyses of Concurrent Systems)"],"award-info":[{"award-number":["ANR-14-CE28-0002 PACS (P Analyses of Concurrent Systems)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,5,31]]},"abstract":"<jats:p>Parameter synthesis for timed systems aims at deriving parameter valuations satisfying a given property. In this article, we target concurrent systems. We use partial-order semantics for parametric time Petri nets as a way to both cope with the well-known state-space explosion due to concurrency and significantly enhance the result of an existing synthesis algorithm. Given a reference parameter valuation, our approach synthesizes other valuations preserving the partial-order executions of the reference parameter valuation. We show the applicability of our approach using a tool applied to asynchronous circuits.<\/jats:p>","DOI":"10.1145\/3012283","type":"journal-article","created":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T17:06:31Z","timestamp":1482167191000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Preserving Partial-Order Runs in Parametric Time Petri Nets"],"prefix":"10.1145","volume":"16","author":[{"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris 13, Sorbonne Paris Cit\u00e9, LIPN, CNRS, Villetaneuse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Chatain","sequence":"additional","affiliation":[{"name":"LSV, ENS Cachan, INRIA, CNRS, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9sar","family":"Rodr\u00edguez","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris 13, Sorbonne Paris Cit\u00e9, LIPN, CNRS, Villetaneuse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,12,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167242"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054109006905"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32759-9_6"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22975-1_3"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40229-6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2045343.2045348"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00114-0"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.08.001"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646733.701312"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11603009_17"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11901914_23"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0074-0"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-3(1:7)2007"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11901914_24"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11767589_8"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-008-0061-x"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2005.34"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01463946"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1567-8326(02)00037-1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2014.2357445"},{"key":"e_1_2_1_22_1","volume-title":"Retrieved","author":"Khomenko Victor","year":"2012","unstructured":"Victor Khomenko . 2012 . Punf . Retrieved November 27, 2016, from http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/tools\/punf\/. Victor Khomenko. 2012. Punf. Retrieved November 27, 2016, from http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/tools\/punf\/."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29072-5_6"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050010"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_6"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.07.023"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIES.2011.5953652"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80476-6"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1976.1093424"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/646734.701480"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1095587"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11867340_21"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/647747.734221"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-011-0102-2"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 26th Conference on Concurrency Theory (CONCUR\u201915)","author":"Rodr\u00edguez C\u00e9sar","year":"2015","unstructured":"C\u00e9sar Rodr\u00edguez , Marcelo Sousa , Subodh Sharma , and Daniel Kroening . 2015 . Unfolding-based partial order reduction . In Proceedings of the 26th Conference on Concurrency Theory (CONCUR\u201915) . 456--469. C\u00e9sar Rodr\u00edguez, Marcelo Sousa, Subodh Sharma, and Daniel Kroening. 2015. Unfolding-based partial order reduction. In Proceedings of the 26th Conference on Concurrency Theory (CONCUR\u201915). 456--469."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02444-8_42"},{"volume-title":"Theory of Linear and Integer Programming","author":"Schrijver Alexander","key":"e_1_2_1_37_1","unstructured":"Alexander Schrijver . 1986. Theory of Linear and Integer Programming . John Wiley 8 Sons, New York, NY. Alexander Schrijver. 1986. Theory of Linear and Integer Programming. John Wiley 8 Sons, New York, NY."},{"key":"e_1_2_1_38_1","volume-title":"Retrieved","author":"Schwoon Stefan","year":"2014","unstructured":"Stefan Schwoon . 2014 . Mole\u2014A Petri Net Unfolder . Retrieved November 27, 2016, from http:\/\/lsv.ens-cachan.fr\/ schwoon\/tools\/mole\/. Stefan Schwoon. 2014. Mole\u2014A Petri Net Unfolder. Retrieved November 27, 2016, from http:\/\/lsv.ens-cachan.fr\/ schwoon\/tools\/mole\/."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_59"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15643-4_22"},{"key":"e_1_2_1_41_1","first-page":"3273","article-title":"Parametric model-checking of stopwatch Petri nets","volume":"15","author":"Traonouez Louis-Marie","year":"2009","unstructured":"Louis-Marie Traonouez , Didier Lime , and Olivier H. Roux . 2009 . Parametric model-checking of stopwatch Petri nets . Journal of Universal Computer Science 15 , 17, 3273 -- 3304 . Louis-Marie Traonouez, Didier Lime, and Olivier H. Roux. 2009. Parametric model-checking of stopwatch Petri nets. Journal of Universal Computer Science 15, 17, 3273--3304.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/647899.741105"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008682131325"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44585-4_16"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3012283","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3012283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:47Z","timestamp":1750222487000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3012283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,19]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5,31]]}},"alternative-id":["10.1145\/3012283"],"URL":"https:\/\/doi.org\/10.1145\/3012283","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2016,12,19]]},"assertion":[{"value":"2016-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}