{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T04:04:20Z","timestamp":1729569860395,"version":"3.28.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031336195"},{"type":"electronic","value":"9783031336201"}],"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"},{"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-33620-1_21","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T08:02:05Z","timestamp":1685174525000},"page":"393-414","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A State Class Based Controller Synthesis Approach for\u00a0Time Petri Nets"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-6254-8691","authenticated-orcid":false,"given":"Loriane","family":"Leclercq","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9429-7586","authenticated-orcid":false,"given":"Didier","family":"Lime","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1665-0481","authenticated-orcid":false,"given":"Olivier H.","family":"Roux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"issue":"2","key":"21_CR1","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.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"2800","DOI":"10.1109\/TAC.2021.3093618","volume":"67","author":"F Basile","year":"2022","unstructured":"Basile, F., Cordone, R., Piroddi, L.: Supervisory control of timed discrete-event systems with logical and temporal specifications. IEEE Trans. Autom. Control 67(6), 2800\u20132815 (2022). https:\/\/doi.org\/10.1109\/TAC.2021.3093618","journal-title":"IEEE Trans. Autom. Control"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K.G., Lime, D.: UPPAAL-TIGA: time for playing games! In: 19th International Conference on Computer Aided Verification (CAV 2007). Lecture Notes in Computer Science, vol. 4590, pp. 121\u2013125. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_14","DOI":"10.1007\/978-3-540-73368-3_14"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_3"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11562948_23","volume-title":"Automated Technology for Verification and Analysis","author":"B B\u00e9rard","year":"2005","unstructured":"B\u00e9rard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of different semantics for Time Petri Nets. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 293\u2013307. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11562948_23"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/32.75415","volume":"17","author":"B Berthomieu","year":"1991","unstructured":"Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using Time Petri Nets. IEEE Trans. Soft. Eng. 17(3), 259\u2013273 (1991)","journal-title":"IEEE Trans. Soft. Eng."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-36577-X_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Berthomieu","year":"2003","unstructured":"Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of Time Petri Nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 442\u2013457. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_33"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-10512-3_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"B Berthomieu","year":"2014","unstructured":"Berthomieu, B., Dal Zilio, S., Fronc, \u0141, Vernadat, F.: Time Petri Nets with dynamic firing dates: semantics and applications. In: Legay, A., Bozga, M. (eds.) FORMATS 2014. LNCS, vol. 8711, pp. 85\u201399. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10512-3_7"},{"key":"21_CR9","unstructured":"Berthomieu, B., Menasche, M.: An enumerative approach for analyzing Time Petri Nets. In: Proceedings IFIP, pp. 41\u201346. Elsevier Science Publishers (1983)"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"435","DOI":"10.3166\/tsi.22.435-459","volume":"22","author":"H Boucheneb","year":"2003","unstructured":"Boucheneb, H., Mullins, J.: Analyse des r\u00e9seaux temporels\u202f: Calcul des classes en $$O(n^2)$$ et des temps de chemin en $$O(m\\times n)$$. TSI. Technique et science informatiques 22(4), 435\u2013459 (2003)","journal-title":"TSI. Technique et science informatiques"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.scico.2016.08.008","volume":"132","author":"PA Bourdil","year":"2016","unstructured":"Bourdil, P.A., Berthomieu, B., Dal Zilio, S., Vernadat, F.: Symmetry reduction for Time Petri Net state classes. Sci. Comput. Program. 132, 209\u2013225 (2016)","journal-title":"Sci. Comput. Program."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/3-540-36494-3_54","volume-title":"STACS 2003","author":"P Bouyer","year":"2003","unstructured":"Bouyer, P.: Untameable timed automata! In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 620\u2013631. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_54"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-319-41528-4_28","volume-title":"Computer Aided Verification","author":"P Bouyer","year":"2016","unstructured":"Bouyer, P., Colange, M., Markey, N.: Symbolic optimal reachability in weighted timed automata. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 513\u2013530. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_28"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11539452_9","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F Cassez","year":"2005","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 66\u201380. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_9"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 313\u2013329. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054180"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"DL Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197\u2013212. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52148-8_17"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Gardey, G., Roux, O.F., Roux, O.H.: Safety control synthesis for Time Petri Nets. In: 8th International Workshop on Discrete Event Systems (WODES 2006), pp. 222\u2013228. IEEE Computer Society Press, Ann Arbor, USA, July 2006","DOI":"10.1109\/WODES.2006.1678434"},{"issue":"3","key":"21_CR18","first-page":"301","volume":"6","author":"G Gardey","year":"2006","unstructured":"Gardey, G., Roux, O.H., Roux, O.F.: State space computation and analysis of time Petri nets. Theory and Practice of Logic Programming (TPLP). Special Issue Specif. Anal. Verif. React. Syst. 6(3), 301\u2013320 (2006)","journal-title":"Special Issue Specif. Anal. Verif. React. Syst."},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Heidari, P., Boucheneb, H.: Maximally permissive controller synthesis for time petri nets. Int. J. Control 86 (2013). https:\/\/doi.org\/10.1080\/00207179.2012.743038","DOI":"10.1080\/00207179.2012.743038"},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"Horv\u00e1th, A., Paolieri, M., Ridi, L., Vicario, E.: Transient analysis of non-markovian models using stochastic state classes. Perform. Eval. 69(7), 315\u2013335 (2012). https:\/\/doi.org\/10.1016\/j.peva.2011.11.002, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166531611001520, selected papers from QEST 2010","DOI":"10.1016\/j.peva.2011.11.002"},{"key":"21_CR21","doi-asserted-by":"publisher","unstructured":"Jones, N.D., Landweber, L.H., Edmund Lien, Y.: Complexity of some problems in petri nets. Theoret. Comput. Sci. 4(3), 277\u2013299 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90014-7, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397577900147","DOI":"10.1016\/0304-3975(77)90014-7"},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TAC.2020.3046578","volume":"67","author":"A Jovanovi\u0107","year":"2022","unstructured":"Jovanovi\u0107, A., Lime, D., Roux, O.H.: Control of real-time systems with integer parameters. IEEE Trans. Autom. Control 67(1), 75\u201388 (2022). https:\/\/doi.org\/10.1109\/TAC.2020.3046578","journal-title":"IEEE Trans. Autom. Control"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-00768-2_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Lime","year":"2009","unstructured":"Lime, D., Roux, O.H., Seidner, C., Traonouez, L.-M.: Romeo: a parametric model-checker for Petri Nets with stopwatches. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 54\u201357. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_6"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-59042-0_76","volume-title":"STACS 95","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229\u2013242. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_76"},{"key":"21_CR25","doi-asserted-by":"publisher","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete event processes. SIAM J. Control Optim. 25(1), 206\u2013230 (1987). https:\/\/doi.org\/10.1137\/0325013","DOI":"10.1137\/0325013"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-59042-0_57","volume-title":"STACS 95","author":"W Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1\u201313. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_57"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Toussaint, J., Simonot-Lion, F., Thomesse, J.P.: Time constraint verifications methods based on time Petri nets. In: IEEE, Future Trends in Distributed Computing Systems (FTDCS 1997), pp. 262\u2013267 (1997)","DOI":"10.1109\/FTDCS.1997.644736"}],"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-031-33620-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T06:14:00Z","timestamp":1729491240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33620-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031336195","9783031336201"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33620-1_21","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":"28 May 2023","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"25 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2023.deec.fct.unl.pt\/","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":"47","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":"21","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":"45% - 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":"4","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":"5","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)"}}]}}
