{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:08Z","timestamp":1725489488655},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_22","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:26:08Z","timestamp":1187238368000},"page":"277-289","source":"Crossref","is-referenced-by-count":0,"title":["A Complete Axiomatisation for Timed Automata"],"prefix":"10.1007","author":[{"given":"Huimin","family":"Lin","sequence":"first","affiliation":[]},{"given":"Wang","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"22_CR1","unstructured":"E. Asarin, P. Caspi and O. Maler. A Kleene theorem for timed automata. In proceedings of LICS\u201997, 1997."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183\u2013235. 1994.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0304-3975(94)00285-9","volume":"152","author":"L. Aceto","year":"1995","unstructured":"L. Aceto and A. Jeffrey. A complete axiomatization of timed bisimulation for a class of timed regular behaviours. Theoretical Computer Science, 152(2):251\u2013268. 1995.","journal-title":"Theoretical Computer Science"},{"key":"22_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BFb0014325","volume-title":"AMAST\u201996","author":"M. Boreale","year":"1996","unstructured":"M. Boreale. Symbolic Bisimulation for Timed Processes. InAMAST\u201996, LNCS 1101 pp.321\u2013335. Springer-Verlag. 1996."},{"key":"22_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-48523-6_18","volume-title":"ICALP\u201999","author":"P. Bouyer","year":"1999","unstructured":"P. Bouyer and A. Petit. Decomposition and Composition of Timed Automata. In ICALP\u201999, LNCS 1644, pp. 210\u2013219. Springer-Verlag. 1999."},{"key":"22_CR6","unstructured":"S. Bornot and J. Sifakis. An Algebraic Framework for Urgency. In Calculational System Design, NATO Science Series, Computer and Systems Science 173, Marktoberdorf, July 1998."},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","first-page":"302","volume-title":"CAV\u201992","author":"K. \u010cer\u00e4ns","year":"1992","unstructured":"K. \u010cer\u00e4ns. Decidability of Bisimulation Equivalences for Parallel Timer Processes. In CAV\u201992, LNCS 663, pp.302\u2013315. Springer-Verlag. 1992."},{"key":"22_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-61648-9_37","volume-title":"FTRTFTS\u201996","author":"P.R. D\u2019Argenio","year":"1996","unstructured":"P.R. D\u2019Argenio and Ed Brinksma. A Calculus for Timed Automata (Extended Abstract). In FTRTFTS\u201996, LNCS 1135, pp.110\u2013129. 1996."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353\u2013389, 1995.","journal-title":"Theoretical Computer Science"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/BF01213531","volume":"8","author":"M. Hennessy","year":"1996","unstructured":"M. Hennessy and H. Lin. Proof systems for message-passing process algebras. Formal Aspects of Computing, 8:408\u2013427, 1996.","journal-title":"Formal Aspects of Computing"},{"key":"22_CR11","series-title":"Lect Notes Comput Sci","volume-title":"A proof system for timed automata. Fossacs\u20192000","author":"H. Lin","year":"2000","unstructured":"H. Lin and Y. Wang. A proof system for timed automata. Fossacs\u20192000, LNCS 1784. March 2000."},{"key":"22_CR12","unstructured":"H. Lin and Y. Wang. A complete proof system for timed automata (Full version). Available at: \n                    http:\/\/www.it.uu.se\/research\/reports\/\n                    \n                  ."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"R. Milner. A complete inference system for a class of regular behaviours. J. Computer and System Science, 28:439\u2013466, 1984.","journal-title":"J. Computer and System Science"},{"key":"22_CR14","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"22_CR15","unstructured":"Wang Yi. A Calculus of Real Time Systems. Ph.D. thesis, Chalmers University, 1991."},{"key":"22_CR16","unstructured":"Wang Yi, Paul Pettersson, and Mats Daniels. Automatic Verification of Real-Time Communicating Systems By Constraint-Solving. In Proc. of the 7th International Conference on Formal Description Techniques, 1994."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T17:51:46Z","timestamp":1550771506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}