{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T21:36:59Z","timestamp":1775684219719,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540450269","type":"print"},{"value":"9783540450313","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11867340_7","type":"book-chapter","created":{"date-parts":[[2006,9,25]],"date-time":"2006-09-25T09:06:53Z","timestamp":1159175213000},"page":"82-97","source":"Crossref","is-referenced-by-count":32,"title":["Bridging the Gap Between Timed Automata and Bounded Time Petri Nets"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Berthomieu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Peres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Vernadat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/3-540-48683-6_3","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1999","unstructured":"Alur, R.: Timed automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 8\u201322. Springer, Heidelberg (1999)"},{"key":"7_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.L.: A theory of timed automata. TCS\u00a0126, 183\u2013235 (1994)","journal-title":"TCS"},{"key":"7_CR3","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., Roux, O.H., Lime, D.: 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)"},{"issue":"3","key":"7_CR4","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. on Software Engineering\u00a017(3), 259\u2013273 (1991)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"7_CR5","first-page":"41","volume":"9","author":"B. Berthomieu","year":"1983","unstructured":"Berthomieu, B., Menasche, M.: An enumerative approach for analyzing time Petri nets. IFIP Congress Series\u00a09, 41\u201346 (1983)","journal-title":"IFIP Congress Series"},{"key":"7_CR6","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.\u00a02619, pp. 442\u2013457. Springer, Heidelberg (2003)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-49213-5_5","volume-title":"Compositionality: The Significant Difference","author":"S. Bornot","year":"1998","unstructured":"Bornot, S., Sifakis, J., Tripakis, S.: Modeling urgency in timed systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 103\u2013129. Springer, Heidelberg (1998)"},{"key":"7_CR8","unstructured":"Bouyer, P., Haddad, S., Reynier, P.-A.: Extended timed automata and time Petri nets. In: Proc. of 6th Int. Conf. on Application of Concurrency to System Design (ACSD 2006), Turku, Finland. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Cassez, F., Roux, O.H.: Structural translation from time petri nets to timed automata. Journal of Systems and Software (forthcoming, 2006)","DOI":"10.1016\/j.jss.2005.12.021"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11539452_13","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"P.R. D\u2019Argenio","year":"2005","unstructured":"D\u2019Argenio, P.R., Gebremichael, B.: The coarsest congruence for timed automata with deadlines contained in bisimulation. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 125\u2013140. Springer, Heidelberg (2005)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Haar, S., Kaiser, L., Simonot-Lion, F., Toussaint, J.: Equivalence of Timed State Machines and safe Time Petri Nets. In: Proc. of the 6th Workshop on Discrete Events Systems (WODES 2002), Zaragoza, Spain, pp. 119\u2013124 (October 2002)","DOI":"10.1109\/WODES.2002.1167678"},{"key":"7_CR12","unstructured":"Hack, M.: Petri net languages. TR 159. MIT, Cambridge, Mass (1976)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-60249-6_41","volume-title":"Fundamentals of Computation Theory","author":"K.G. Larsen","year":"1995","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.Y.: Model-checking for real-time systems. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 62\u201388. Springer, Heidelberg (1995)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/PNPM.2003.1231549","volume-title":"10th International Workshop on Petri Nets and Performance Models, (PNPM 2003)","author":"D. Lime","year":"2003","unstructured":"Lime, D., Roux, O.H.: State class timed automaton of a time Petri net. In: 10th International Workshop on Petri Nets and Performance Models (PNPM 2003), Urbana, USA, September 2003, pp. 124\u2013133. IEEE Computer Society, Los Alamitos (2003)"},{"issue":"9","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TCOM.1976.1093424","volume":"24","author":"P.M. Merlin","year":"1976","unstructured":"Merlin, P.M., Farber, D.J.: Recoverability of communication protocols: Implications of a theoretical study. IEEE Tr. Comm.\u00a024(9), 1036\u20131043 (1976)","journal-title":"IEEE Tr. Comm."}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11867340_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T23:57:56Z","timestamp":1736553476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11867340_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540450269","9783540450313"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11867340_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}