{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T12:19:19Z","timestamp":1774441159696,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T00:00:00Z","timestamp":1774396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T00:00:00Z","timestamp":1774396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Institute of Mathematics of the Czech Academy of Sciences","award":["RVO 67985840"],"award-info":[{"award-number":["RVO 67985840"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s10626-026-00441-0","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T09:20:50Z","timestamp":1774430450000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weakly strong semantics of Time Petri Nets and its algebraic description"],"prefix":"10.1007","volume":"36","author":[{"given":"Jan","family":"Komenda","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Lahaye","sequence":"additional","affiliation":[]},{"given":"R\u00e9mi","family":"Parrot","sequence":"additional","affiliation":[]},{"given":"Olivier H.","family":"Roux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,25]]},"reference":[{"key":"441_CR1","volume-title":"Synchronization and Linearity","author":"F Baccelli","year":"1992","unstructured":"Baccelli F, Cohen G, Olsder G-J, Quadrat J-P (1992) Synchronization and Linearity. Wiley, Chichester"},{"issue":"3","key":"441_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/32.75415","volume":"17","author":"B Berthomieu","year":"1991","unstructured":"Berthomieu B, Diaz M (1991) Modeling and verification of time dependent systems using time Petri nets. IEEE Trans on Soft Engineering 17(3):259\u2013273","journal-title":"IEEE Trans on Soft Engineering"},{"key":"441_CR3","unstructured":"Berthomieu B, Menasche M (1983) An enumerative approach for analyzing time petri nets. In: Proceedings IFIP, pp 41\u201346. Elsevier Science Publishers, Paris"},{"issue":"3","key":"441_CR4","first-page":"225","volume":"88","author":"M Boyer","year":"2008","unstructured":"Boyer M, Roux OH (2008) On the compared expressiveness of arc, place and transition time Petri nets. Fund Inform 88(3):225\u2013249","journal-title":"Fund Inform"},{"key":"441_CR5","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.automatica.2017.11.030","volume":"94","author":"RMF Candido","year":"2018","unstructured":"Candido RMF, Hardouin L, Lhommeau M, Santos Mendes R (2018) Conditional reachability of uncertain max plus linear systems. Automatica 94:426\u2013435. https:\/\/doi.org\/10.1016\/j.automatica.2017.11.030","journal-title":"Automatica"},{"key":"441_CR6","doi-asserted-by":"crossref","unstructured":"Daviaud B, Lahaye S, Lhommeau M, Komenda J (2023) Representation of time petri nets using interval weighted automata. In: 2023 9th International Conference on Control, Decision and Information Technologies (CoDIT), pp 99\u2013104. IEEE","DOI":"10.1109\/CoDIT58514.2023.10284333"},{"key":"441_CR7","doi-asserted-by":"crossref","unstructured":"Dill DL (1989) Timing assumptions and verification of finite-state concurrent systems. Automatic Verification Methods for Finite State Systems, vol 407. LNCS. Springer, Berlin, Heidelberg, pp 197\u2013212","DOI":"10.1007\/3-540-52148-8_17"},{"issue":"3","key":"441_CR8","first-page":"301","volume":"6","author":"G Gardey","year":"2006","unstructured":"Gardey G, Roux OH, Roux OF (2006) State space computation and analysis of time Petri nets. Theory and Practice of Logic Programming (TPLP). Special Issue Specif Anal Verif Reactive Syst 6(3):301\u2013320","journal-title":"Special Issue Specif Anal Verif Reactive Syst"},{"issue":"12","key":"441_CR9","first-page":"2014","volume":"40","author":"S Gaubert","year":"1995","unstructured":"Gaubert S (1995) Performance Evaluation of (max,+) Automata. IEEE TAC 40(12):2014\u20132025","journal-title":"IEEE TAC"},{"issue":"4","key":"441_CR10","first-page":"683","volume":"44","author":"S Gaubert","year":"1999","unstructured":"Gaubert S, Mairesse J (1999) Modeling and Analysis of Timed Petri Nets using Heaps of Pieces. IEEE TAC 44(4):683\u2013698","journal-title":"IEEE TAC"},{"key":"441_CR11","doi-asserted-by":"crossref","unstructured":"Hanisch HM (1993) Analysis of place\/transition nets with timed-arcs and its application to batch process control. In: ICATPN\u201993. LNCS, vol 691, pp 282\u2013299","DOI":"10.1007\/3-540-56863-8_52"},{"key":"441_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"ND Jones","year":"1977","unstructured":"Jones ND, Landweber LH, Lien YE (1977) Complexity of some problems in Petri nets. Theoret Comput Sci 4:277\u2013299","journal-title":"Theoret Comput Sci"},{"key":"441_CR13","unstructured":"Khansa W, Denat J-P, Collart-Dutilleul S (1996) P-time Petri nets for manufacturing systems. In: WODES\u201996, Edinburgh (U.K.), pp 94\u2013102"},{"key":"441_CR14","doi-asserted-by":"crossref","unstructured":"Komenda J, Lahaye S, Parrot R, Roux OH (2024) Weakly strong semantics of time petri nets for performance evaluations. IFAC-PapersOnLine 58(1):66\u201371. 17th IFAC Workshop on discrete Event Systems WODES 2024","DOI":"10.1016\/j.ifacol.2024.07.012"},{"key":"441_CR15","doi-asserted-by":"crossref","unstructured":"Komenda J, Lai A, Soto JG, Lahaye S, Boimond J-l (2020) Modeling of safe time petri nets by interval weighted automata. IFAC-PapersOnLine 53(4):187\u2013192","DOI":"10.1016\/j.ifacol.2021.04.018"},{"key":"441_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10626-014-0186-6","volume":"25","author":"S Lahaye","year":"2015","unstructured":"Lahaye S, Komenda J, Boimond JL (2015) Compositions of (max,+) automata. Discrete Event Dyn Syst 25:323\u2013344. https:\/\/doi.org\/10.1007\/s10626-014-0186-6","journal-title":"Discrete Event Dyn Syst"},{"issue":"9","key":"441_CR17","doi-asserted-by":"publisher","first-page":"3706","DOI":"10.1109\/TAC.2018.2887353","volume":"64","author":"RS Mendes","year":"2019","unstructured":"Mendes RS, Hardouin L, Lhommeau M (2019) Stochastic filtering of max-plus linear systems with bounded disturbances. IEEE Trans Autom Control 64(9):3706\u20133715","journal-title":"IEEE Trans Autom Control"},{"key":"441_CR18","unstructured":"Merlin PM (1974) A study of the recoverability of computing systems. PhD thesis, Dep. of Information and Computer Science, University of California, Irvine"},{"key":"441_CR19","volume-title":"Computation: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky M (1967) Computation: Finite and Infinite Machines. Prentice-Hall Inc, USA"},{"key":"441_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41115-1","volume-title":"Time and Petri Nets","author":"L Popova-Zeugmann","year":"2013","unstructured":"Popova-Zeugmann L (2013) Time and Petri Nets. Springer, Berlin Heidelberg"},{"key":"441_CR21","unstructured":"Ramchandani C (1974) Analysis of asynchronous concurrent systems by timed Petri nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA"},{"key":"441_CR22","series-title":"Springer","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-04081-8_37","volume-title":"CONCUR 2009 - Concurrency Theory","author":"P-A Reynier","year":"2009","unstructured":"Reynier P-A, Sangnier A (2009) Weak time Petri nets strike back. In: Bravetti M, Zavattaro G (eds) CONCUR 2009 - Concurrency Theory, vol 5710. Springer. Berlin, Heidelberg, pp 557\u2013571"},{"key":"441_CR23","unstructured":"Riviere N, Valette R, Pradin-Chezalviel B, Ups I (2001) Reachability and temporal conflicts in t-time petri nets. IEEE Intern Workshop Petri Nets Perform Models"},{"issue":"10","key":"441_CR24","doi-asserted-by":"publisher","first-page":"2326","DOI":"10.1016\/j.automatica.2011.06.024","volume":"47","author":"R Su","year":"2011","unstructured":"Su R, Woeginger GJ (2011) String execution time for finite languages: Max is easy, min is hard. Autom 47(10):2326\u20132329","journal-title":"Autom"},{"key":"441_CR25","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ifacol.2021.04.049","volume":"53\u20134","author":"L Triska","year":"2020","unstructured":"Triska L, Moor T (2020) Behaviour equivalent max-plus automata for a class of timed petri nets. IFAC PapersOnLine 53\u20134:75\u201382","journal-title":"IFAC PapersOnLine"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-026-00441-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10626-026-00441-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-026-00441-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T09:20:55Z","timestamp":1774430455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10626-026-00441-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,25]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["441"],"URL":"https:\/\/doi.org\/10.1007\/s10626-026-00441-0","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,25]]},"assertion":[{"value":"28 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"11"}}