{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T07:40:11Z","timestamp":1736235611694,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_22","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"273-284","source":"Crossref","is-referenced-by-count":0,"title":["When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?"],"prefix":"10.1007","author":[{"given":"Beatrice","family":"B\u00e9rard","sequence":"first","affiliation":[]},{"given":"Franck","family":"Cassez","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[]},{"given":"Didier","family":"Lime","sequence":"additional","affiliation":[]},{"given":"Olivier H.","family":"Roux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","first-page":"7","volume-title":"Journal of Logic and Algebraic Programming","author":"L. Aceto","year":"2002","unstructured":"Aceto, L., Laroussinie, F.: Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. In: Journal of Logic and Algebraic Programming, vol.\u00a052-53, pp. 7\u201351. Elsevier Science Publishers, Amsterdam (august 2002)"},{"key":"22_CR2","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. Theoretical Computer Science B\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science B"},{"issue":"1-2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S0304-3975(99)00114-0","volume":"243","author":"T. Aura","year":"2000","unstructured":"Aura, T., Lilius, J.: A causal semantics for time Petri nets. Theoretical Computer Science\u00a0243(1-2), 409\u2013447 (2000)","journal-title":"Theoretical Computer Science"},{"key":"22_CR4","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.\u00a03707, pp. 293\u2013307. Springer, Heidelberg (2005) (to appear)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11603009_17","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"B. B\u00e9rard","year":"2005","unstructured":"B\u00e9rard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of the Expressiveness of Timed Automata and Time Petri Nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 211\u2013225. Springer, Heidelberg (2005) (to appear)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"B\u00e9rard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of the Expressiveness of Timed Automata and Time Petri Nets (2005), Research Report IRCCyN R2005-2 available at http:\/\/www.lamsade.dauphine.fr\/~haddad\/publis.html","DOI":"10.1007\/11603009_17"},{"issue":"3","key":"22_CR7","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 Transactions on Software Engineering\u00a017(3), 259\u2013273 (1991)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"22_CR8","series-title":"Electronic Notes in Computer Science","volume-title":"Workshop on Automated Verification of Critical Systems (AVoCS 2004)","author":"F. Cassez","year":"2004","unstructured":"Cassez, F., Roux, O.H.: Structural Translation of Time Petri Nets into Timed Automata. In: Huth, M. (ed.) Workshop on Automated Verification of Critical Systems (AVoCS 2004). Electronic Notes in Computer Science, Elsevier, Amsterdam (August 2004)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D.L. Dill","year":"1989","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, Springer, Heidelberg (1989)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Haar, S., Simonot-Lion, F., Kaiser, L., Toussaint, J.: Equivalence of Timed State Machines and safe Time Petri Nets. In: Proceedings of WODES 2002, Zaragoza, Spain, pp. 119\u2013126 (2002)","DOI":"10.1109\/WODES.2002.1167678"},{"key":"22_CR11","volume-title":"PNPM 2003","author":"D. Lime","year":"2003","unstructured":"Lime, D., Roux, O.H.: State class timed automaton of a time Petri net. In: PNPM 2003, September 2003, IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"22_CR12","unstructured":"Merlin, P.M.: A study of the recoverability of computing systems. Ph.D thesis, University of California, Irvine, CA (1974)"},{"key":"22_CR13","unstructured":"Pezz\u00e9, M., Young, M.: Time Petri Nets: A Primer Introduction. In: Tutorial presented at the Multi-Workshop on Formal Methods in Performance Evaluation and Applications, Zaragoza, Spain (September 1999)"},{"key":"22_CR14","unstructured":"Ramchandani, C.: Analysis of asynchronous concurrent systems by timed Petri nets. Ph.D thesis, Massachusetts Institute of Technology, Cambridge, MA (1974)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:11:44Z","timestamp":1736140304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11590156_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}