乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:48:56Z","timestamp":1725792536619},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319061993"},{"type":"electronic","value":"9783319062006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06200-6_26","type":"book-chapter","created":{"date-parts":[[2014,4,23]],"date-time":"2014-04-23T01:53:48Z","timestamp":1398218028000},"page":"307-312","source":"Crossref","is-referenced-by-count":6,"title":["Memory Efficient Data Structures for Explicit Verification of Timed Systems"],"prefix":"10.1007","author":[{"given":"Peter Gj\u00f8l","family":"Jensen","sequence":"first","affiliation":[]},{"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[]},{"given":"Mathias Grund","family":"S\u00f8rensen","sequence":"additional","affiliation":[]},{"given":"Jakob Haar","family":"Taankvist","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-36046-6_8","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"M. Andersen","year":"2013","unstructured":"Andersen, M., Gatten Larsen, H., Srba, J., Grund S\u00f8rensen, M., Haahr Taankvist, J.: Verification of liveness properties on closed timed-arc Petri nets. In: Ku\u010dera, A., Henzinger, T.A., Ne\u0161et\u0159il, J., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2012. LNCS, vol.\u00a07721, pp. 69\u201381. Springer, Heidelberg (2013)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/BFb0055642","volume-title":"CONCUR \u201998 Concurrency Theory","author":"E. Asarin","year":"1998","unstructured":"Asarin, E., Maler, O., Pnueli, A.: On discretization of delays in timed automata and digital circuits. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 470\u2013484. Springer, Heidelberg (1998)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-48153-2_11","volume-title":"Correct Hardware Design and Verification Methods","author":"M. Bozga","year":"1999","unstructured":"Bozga, M., Maler, O., Tripakis, S.: Efficient verification of timed automata using dense and discrete time semantics. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 125\u2013141. Springer, Heidelberg (1999)"},{"issue":"8","key":"26_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"doi-asserted-by":"crossref","unstructured":"Byg, J., Jacobsen, M., Jacobsen, L., J\u00f8rgensen, K.Y., M\u00f8ller, M.H., Srba, J.: TCTL-preserving translations from timed-arc Petri nets to networks of timed automata. In: TCS (2013), \n \n http:\/\/dx.doi.org\/10.1016\/j.tcs.2013.07.011","key":"26_CR5","DOI":"10.1016\/j.tcs.2013.07.011"},{"issue":"16","key":"26_CR6","doi-asserted-by":"publisher","first-page":"8160","DOI":"10.1016\/j.amc.2012.02.018","volume":"218","author":"F. Cicirelli","year":"2012","unstructured":"Cicirelli, F., Furfaro, A., Nigro, L.: Model checking time-dependent system specifications using time stream Petri nets and UPPAAL. Applied Mathematics and Computation\u00a0218(16), 8160\u20138186 (2012)","journal-title":"Applied Mathematics and Computation"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-28756-5_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. David","year":"2012","unstructured":"David, A., Jacobsen, L., Jacobsen, M., J\u00f8rgensen, K.Y., M\u00f8ller, M.H., Srba, J.: TAPAAL 2.0: Integrated development environment for timed-arc Petri nets. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol.\u00a07214, pp. 492\u2013497. Springer, Heidelberg (2012)"},{"key":"26_CR8","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":"D.L. Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 197\u2013212. Springer, Heidelberg (1990)"},{"issue":"9","key":"26_CR9","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Communications of the ACM\u00a03(9), 490\u2013499 (1960)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"J\u00f8rgensen, K.Y., Larsen, K.G., Srba, J.: Time-darts: A data structure for verification of closed timed automata. In: SSV 2012. EPTCS, vol.\u00a0102, pp. 141\u2013155. Open Publishing Association (2012)","key":"26_CR10","DOI":"10.4204\/EPTCS.102.13"},{"issue":"2","key":"26_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10009-012-0231-4","volume":"15","author":"A.P. Marques Jr.","year":"2013","unstructured":"Marques Jr., A.P., Ravn, A.P., Srba, J., Vighio, S.: Model-checking web services business activity protocols. International Journal on Software Tools for Technology Transfer (STTT)\u00a015(2), 125\u2013147 (2013)","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11560548_14","volume-title":"Correct Hardware Design and Verification Methods","author":"L. Lamport","year":"2005","unstructured":"Lamport, L.: Real-time model checking is really simple. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol.\u00a03725, pp. 162\u2013175. Springer, Heidelberg (2005)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/363347.363366","volume":"11","author":"W.C. Lynch","year":"1968","unstructured":"Lynch, W.C.: Computer systems: Reliable full-duplex file transmission over half-duplex telephone line. Communications of the ACM\u00a011, 407\u2013410 (1968)","journal-title":"Communications of the ACM"},{"unstructured":"Pelayo, F.L., Cuartero, F., Valero, V., Macia, H., Pelayo, M.L.: Applying timed-arc Petri nets to improve the performance of the MPEG-2 encoding algorithm. In: MMM 2004, pp. 49\u201356. IEEE Computer Society (2004)","key":"26_CR14"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06200-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T13:30:01Z","timestamp":1558877401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06200-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319061993","9783319062006"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06200-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}