{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:23:37Z","timestamp":1725899017889},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314230"},{"type":"electronic","value":"9783642314247"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31424-7_33","type":"book-chapter","created":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T10:26:49Z","timestamp":1340274409000},"page":"444-461","source":"Crossref","is-referenced-by-count":7,"title":["On Decidability of Prebisimulation for Timed Automata"],"prefix":"10.1007","author":[{"given":"Shibashis","family":"Guha","sequence":"first","affiliation":[]},{"given":"Chinmay","family":"Narayan","sequence":"additional","affiliation":[]},{"given":"S.","family":"Arun-Kumar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Larsen, K.J., Srba, J.: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511814105"},{"key":"33_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. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica (1992)","DOI":"10.1007\/BF01191894"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J.E. Bengtsson","year":"2004","unstructured":"Bengtsson, J.E., Yi, W.: Timed Automata: Semantics, Algorithms and Tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods System Design\u00a024(3), 281\u2013320 (2004)","journal-title":"Formal Methods System Design"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-56496-9_24","volume-title":"Computer Aided Verification","author":"K. Cerans","year":"1993","unstructured":"Cerans, K.: Decidability of Bisimulation Equivalences for Parallel Timer Processes. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 302\u2013315. Springer, Heidelberg (1993)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/3-540-60246-1_150","volume-title":"Mathematical Foundations of Computer Science 1995","author":"F. Corradini","year":"1995","unstructured":"Corradini, F., Gorrieri, R., Roccetti, M.: Performance Preorder: Ordering Processes with Respect to Speed. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 444\u2013453. Springer, Heidelberg (1995)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C. Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model Checking of Real-Time Reachability Properties Using Abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 313\u2013329. Springer, Heidelberg (1998)"},{"key":"33_CR9","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)"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-36577-X_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2003","unstructured":"Behrmann, G., Bouyer, P., Fleury, E., Larsen, K.G.: Static Guard Analysis in Timed Automata Verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 254\u2013270. Springer, Heidelberg (2003)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s10009-005-0190-0","volume":"8","author":"K.G. Larsen","year":"2006","unstructured":"Larsen, K.G., Behrmann, G., Bouyer, P., Pelanek, R.: Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transf.\u00a08, 204\u2013215 (2006)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Geilen, M., Tripakis, S., Wiggers, M.: The earlier the better: a theory of timed actor interfaces. In: Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control, pp. 23\u201332 (2011)","DOI":"10.1145\/1967701.1967707"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Guha, S., Narayan, C., Arun-Kumar, S.: On decidability of prebisimulation for timed automata. Technical Report, Indian Institute of Technology Delhi, New Delhi, India (2012), \n                    \n                      http:\/\/www.cse.iitd.ernet.in\/~shibashis\/webpage\/prebisim.pdf","DOI":"10.1007\/978-3-642-31424-7_33"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T.A. Henzinger","year":"1994","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation\u00a0111, 193\u2013244 (1994)","journal-title":"Information and Computation"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BFb0026571","volume-title":"Theory and Practice of Parallel Programming","author":"I.I. Satoh","year":"1995","unstructured":"Satoh, I.I., Tokoro, M.: A Formalism for Remotely Interacting Processes. In: Ito, T. (ed.) TPPP 1994. LNCS, vol.\u00a0907, pp. 216\u2013228. Springer, Heidelberg (1995)"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-58027-1_8","volume-title":"Mathematical Foundations of Programming Semantics","author":"K.G. Larsen","year":"1994","unstructured":"Larsen, K.G., Yi, W.: Time Abstracted Bisimulation: Implicit Specifications and Decidability. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol.\u00a0802, pp. 160\u2013176. Springer, Heidelberg (1994)"},{"key":"33_CR17","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-54430-5_104","volume-title":"CONCUR \u201991","author":"F. Moller","year":"1991","unstructured":"Moller, F., Tofts, C.: Relating Processes with Respect to Speed. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 424\u2013438. Springer, Heidelberg (1991)"},{"issue":"6","key":"33_CR19","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1008734703554","volume":"18","author":"S. Tripakis","year":"2001","unstructured":"Tripakis, S., Yovine, S.: Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design\u00a018, 25\u201368 (2001)","journal-title":"Formal Methods in System Design"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BFb0023458","volume-title":"STACS 97","author":"C. Weise","year":"1997","unstructured":"Weise, C., Lenzkes, D.: Efficient Scaling-Invariant Checking of Timed Bisimulation. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 177\u2013188. Springer, Heidelberg (1997)"},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1008621829508","volume":"11","author":"M. Yannakakis","year":"1997","unstructured":"Yannakakis, M., Lee, D.: An efficient algorithm for minimizing real-time transition systems. Form. Methods Syst. Des.\u00a011, 113\u2013136 (1997)","journal-title":"Form. Methods Syst. Des."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31424-7_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:59:57Z","timestamp":1620115197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31424-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314230","9783642314247"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31424-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}