{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:31:09Z","timestamp":1725564669921},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152962"},{"type":"electronic","value":"9783642152979"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15297-9_17","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T04:11:13Z","timestamp":1283746273000},"page":"213-227","source":"Crossref","is-referenced-by-count":4,"title":["Simulation and Bisimulation for Probabilistic Timed Automata"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Sproston","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Troina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","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(2), 183\u2013235 (1994)","journal-title":"TCS"},{"key":"17_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes. J. Wiley & Sons, Chichester (1994)"},{"issue":"2","key":"17_CR3","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing\u00a02(2), 250\u2013273 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"17_CR4","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0304-3975(01)00046-9","volume":"286","author":"M. Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. TCS\u00a0286, 101\u2013150 (2002)","journal-title":"TCS"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s001650300007","volume":"14","author":"M. Kwiatkowska","year":"2003","unstructured":"Kwiatkowska, M., Norman, G., Sproston, J.: Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Formal Aspects of Computing\u00a014(3), 295\u2013318 (2003)","journal-title":"Formal Aspects of Computing"},{"key":"17_CR7","first-page":"33","volume":"29","author":"M. Kwiatkowska","year":"2006","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance analysis of probabilistic timed automata using digital clocks. FMSD\u00a029, 33\u201378 (2006)","journal-title":"FMSD"},{"key":"17_CR8","first-page":"481","volume-title":"Proc. IJCAI\u201971","author":"R. Milner","year":"1971","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: Proc. IJCAI\u201971, pp. 481\u2013489. William Kaufmann, San Francisco (1971)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-56496-9_24","volume-title":"Computer Aided Verification","author":"K. \u010cer\u0101ns","year":"1993","unstructured":"\u010cer\u0101ns, 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":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/3-540-61604-7_75","volume-title":"CONCUR \u201996: Concurrency Theory","author":"S. Ta\u015f\u0131ran","year":"1996","unstructured":"Ta\u015f\u0131ran, S., Alur, R., Kurshan, R.P., Brayton, R.K.: Verifying abstractions of timed systems. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 546\u2013562. Springer, Heidelberg (1996)"},{"key":"17_CR13","unstructured":"Bozzelli, L., Legay, A., Pinchinat, S.: On timed alternating simulation for concurrent timed games. In: Proc. FSTTCS\u201909. LIPIcs, vol.\u00a04, pp. 85\u201396. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2009)"},{"issue":"1","key":"17_CR14","first-page":"187","volume":"60","author":"C. Baier","year":"2000","unstructured":"Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. JCSS\u00a060(1), 187\u2013231 (2000)","journal-title":"JCSS"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.N.: Flow faster: Efficient decision algorithms for probabilistic simulations LMCS\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:6)2008"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/3-540-55179-4_41","volume-title":"Computer Aided Verification","author":"U. Holmer","year":"1992","unstructured":"Holmer, U., Larsen, K.G., Yi, W.: Deciding properties of regular real time processes. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 443\u2013453. Springer, Heidelberg (1992)"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. JACM\u00a032(1), 137\u2013161 (1985)","journal-title":"JACM"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-71389-0_21","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Parma","year":"2007","unstructured":"Parma, A., Segala, R.: Logical characterizations of bisimulations for discrete probabilistic systems. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 287\u2013301. Springer, Heidelberg (2007)"},{"key":"17_CR19","unstructured":"Jensen, H.E., Gregersen, H.: Formal design of reliable real time systems. Master\u2019s thesis, Aalborg University (1995)"},{"key":"17_CR20","unstructured":"Jensen, H.E.: Model checking probabilistic real time systems. In: Proc. of the 7th Nordic Work. on Progr. Theory, pp. 247\u2013261. Chalmers Institute of Technology (1996)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/978-3-540-40965-6_18","volume-title":"Advances in Computing Science \u2013 ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation","author":"S. Yamane","year":"2003","unstructured":"Yamane, S.: Probabilistic timed simulation verification and its application to stepwise refinement of real-time systems. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol.\u00a02896, pp. 276\u2013290. Springer, Heidelberg (2003)"},{"key":"17_CR22","first-page":"177","volume-title":"Proc. TASE\u201908","author":"T. Chen","year":"2008","unstructured":"Chen, T., Han, T., Katoen, J.P.: Time-abstracting bisimulation for probabilistic timed automata. In: Proc. TASE\u201908, pp. 177\u2013184. IEEE, Los Alamitos (2008)"},{"key":"17_CR23","first-page":"266","volume-title":"Proc. LICS\u201991","author":"B. Jonsson","year":"1991","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proc. LICS\u201991, pp. 266\u2013277. IEEE, Los Alamitos (1991)"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-46432-8_13","volume-title":"Foundation of Software Science and Computation Structures","author":"F. Laroussinie","year":"2000","unstructured":"Laroussinie, F., Schnoebelen, P.: The state explosion problem from trace to bisimulation equivalence. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 192\u2013207. Springer, Heidelberg (2000)"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-60246-1_158","volume-title":"Mathematical Foundations of Computer Science 1995","author":"F. Laroussinie","year":"1995","unstructured":"Laroussinie, F., Larsen, K.G., Weise, C.: From timed automata to logic \u2013 and back. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 529\u2013539. Springer, Heidelberg (1995)"},{"key":"17_CR26","first-page":"7","volume":"52-53","author":"L. Aceto","year":"2000","unstructured":"Aceto, L., Laroussinie, F.: Is your model checker on time? On the complexity of model checking for timed modal logics. JLAP\u00a052-53, 7\u201351 (2000)","journal-title":"JLAP"},{"key":"17_CR27","unstructured":"Sproston, J.: Model checking for probabilistic timed and hybrid systems. PhD thesis, University of Birmingham (2000)"},{"key":"17_CR28","first-page":"34","volume-title":"Proc. SEFM\u201903","author":"R. Lanotte","year":"2003","unstructured":"Lanotte, R., Maggiolo-Schettini, A., Troina, A.: Weak bisimulation for probabilistic timed automata and applications to security. In: Proc. SEFM\u201903, pp. 34\u201343. IEEE, Los Alamitos (2003)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15297-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:04:31Z","timestamp":1606169071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15297-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152962","9783642152979"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15297-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}