{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:13:57Z","timestamp":1740028437393,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_7","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"71-83","source":"Crossref","is-referenced-by-count":0,"title":["On the Urgency Expressiveness"],"prefix":"10.1007","author":[{"given":"Micha\u00ebl","family":"Ad\u00e9la\u00efde","sequence":"first","affiliation":[]},{"given":"Claire","family":"Pagetti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Ad\u00e9la\u00efde, M., Pagetti, C.: When the minimal number of clocks is computable. Technical Report 1329-04, Labri\/CNRS, Bordeaux (2004), http:\/\/www.labri.fr\/Labri\/Publications\/Rapports-internes\/Publications.htm"},{"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.: A theory of timed automata. Theoretical Computer Science B\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science B"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/3-540-46430-1_5","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2000","unstructured":"Alur, R., Grosu, R., Hur, Y., Kumar, V., Lee, I.: Modular specification of hybrid systems in CHARON. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol.\u00a01790, pp. 6\u201319. Springer, Heidelberg (2000)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A.: Back to the future: Towards a theory of timed regular languages. In: IEEE Symposium on Foundations of Computer Science, pp. 177\u2013186 (1992)","DOI":"10.1109\/SFCS.1992.267774"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.3233\/FI-1999-402302","volume":"40","author":"A. Arnold","year":"2000","unstructured":"Arnold, A., Griffault, A., Point, G., Rauzy, A.: The AltaRica formalism for describing concurrent systems. Fundamenta Informaticae\u00a040, 109\u2013124 (2000)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E. Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM\u00a049(2), 172\u2013206 (2002)","journal-title":"Journal of the ACM"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/inco.2000.2999","volume":"163","author":"S. Bornot","year":"2000","unstructured":"Bornot, S., Sifakis, J.: An algebraic framework for urgency. Information and Computation\u00a0163(1), 172\u2013202 (2000)","journal-title":"Information and Computation"},{"key":"7_CR8","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_CR9","first-page":"167","volume":"7","author":"P. Bouyer","year":"2001","unstructured":"Bouyer, P., Petit, A.: A Kleene\/Bchi-like theorem for clock languages. Journal of Automata, Languages and Combinatorics\u00a07, 167\u2013186 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Cassez, F., Pagetti, C., Roux, O.: A timed extension for AltaRica. To appear in Fundamenta Informaticae (2004)","DOI":"10.3233\/FUN-2004-623-402"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Chandru, V., Rao, M.R.: 175 years of Linear Programming, part 1. The French Connection. The Journal of Science Education (1998)","DOI":"10.1007\/BF02841420"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/REAL.1996.563702","volume-title":"7th IEEE Real Time Systems Symposium, RTSS 1996","author":"C. Daws","year":"1996","unstructured":"Daws, C., Yovine, S.: Reducing the number of clock variables of timed automata. In: 7th IEEE Real Time Systems Symposium, RTSS 1996, Washington, DC, USA, pp. 73\u201381. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"7_CR13","unstructured":"Labroue, A.: Conditions de vivacit\u00e9 dans les automates temporis\u00e9s. Technical Report LSV-98-7, Lab. Specification and Verification, ENS de Cachan (1998)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1025132427497","volume":"25","author":"K. Larsen","year":"2003","unstructured":"Larsen, K., Larsson, F., Pettersson, P.: Efficient verification of real-time systems: Compact data structure and state-space reduction. Real-Time Systems \u2014 The International\u00a025, 255\u2013275 (2003)","journal-title":"Real-Time Systems \u2014 The International"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/REAL.1995.495198","volume-title":"Proc. of the 16th IEEE Real-Time Systems Symposium","author":"K.G. Larsen","year":"1995","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Compositional and Symbolic Model-Checking of Real-Time Systems. In: Proc. of the 16th IEEE Real-Time Systems Symposium, pp. 76\u201387. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-24730-2_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Lugiez","year":"2004","unstructured":"Lugiez, D., Niebert, P., Zennou, S.: A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 296\u2013311. Springer, Heidelberg (2004)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-24727-2_25","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Maler","year":"2004","unstructured":"Maler, O., Pnueli, A.: On Recognizable Timed Languages. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 348\u2013362. Springer, Heidelberg (2004)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","first-page":"347","volume-title":"STACS 1996","author":"J. Sifakis","year":"1996","unstructured":"Sifakis, J., Yovine, S.: Compositional specification of timed systems. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 347\u2013359. Springer, Heidelberg (1996)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Tripakis, S.: Folk Theorems on the Determinization and Minimization of Timed Automata. In: FORMATS (2003)","DOI":"10.1007\/978-3-540-40903-8_15"},{"key":"7_CR20","unstructured":"Wilke, T.: Automaten und Logiken zur Beschreibung zeitabh\u00e4ngiger Systeme. PhD thesis, Inst. f. Informatik u. Prakt. Math., CAU Kiel (1994)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T12:11:59Z","timestamp":1739967119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}