{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:07:33Z","timestamp":1725494853573},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665885"},{"type":"electronic","value":"9783540481188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48118-4_15","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:30:57Z","timestamp":1194985857000},"page":"1226-1244","source":"Crossref","is-referenced-by-count":5,"title":["A more complete TLA"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Merz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,9,17]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0039051","volume-title":"CONCUR\u2019 90, Theories of Concurrency: Unification and Extension","author":"M. Abadi","year":"1990","unstructured":"Mart\u00edn Abadi. An axiomatization of Lamport\u2019s Temporal Logic of Actions. In Jos C. M. Baeten and Jan W. Klop, editors, CONCUR\u2019 90, Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 57\u201369, Berlin, 1990. Springer-Verlag. A revised version is available on the Web at http:\/\/www.research.digital. com\/SRC\/personal\/Martin Abadi\/allpapers.html ."},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"81","author":"M. Abadi","year":"1991","unstructured":"Mart\u00edn Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 81(2):253\u2013284, May 1991.","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Mart\u00edn Abadi and Leslie Lamport. An old-fashioned recipe for real time. Research Report 91, Digital Equipment Corporation, Systems Research Center, 1992. An earlier version, without proofs, appeared in [7, pages 1\u201327].","DOI":"10.1007\/BFb0031985"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"Mart\u00edn Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507\u2013534, May 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-60246-1_155","volume-title":"Mathematical Foundations of Computer Science","author":"M. Abadi","year":"1995","unstructured":"Mart\u00edn Abadi and Stephan Merz. An abstract account of composition. In Ji\u0159\u00ed Wiedermann and Petr Hajek, editors, Mathematical Foundations of Computer Science, volume 969 of Lecture Notes in Computer Science, pages 499\u2013508, Berlin, 1995. Springer-Verlag."},{"key":"15_CR6","series-title":"NATO ASI series","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-61455-2_14","volume-title":"Deductive Program Design","author":"M. Abadi","year":"1996","unstructured":"Mart\u00edn Abadi and Stephan Merz. On TLA as a logic. In Manfred Broy, editor, Deductive Program Design, NATO ASI series F, pages 235\u2013272. Springer-Verlag, Berlin, 1996."},{"key":"15_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0031984","volume-title":"Real-Time: Theory in Practice","author":"J.W. Bakker de","year":"1992","unstructured":"J.W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, editors. Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992. Proceedings of a REX Real-TimeWorkshop, held in The Netherlands in June, 1991."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Dov Gabbay, Amir Pnueli, S. Shelah, and Jonathan Stavi. On the temporal analysis of fairness. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages, pages 163\u2013173. ACM, 1980.","DOI":"10.1145\/567446.567462"},{"key":"15_CR9","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-71549-5","volume-title":"Temporal Logic of Programs","author":"F. Kr\u00f6ger","year":"1987","unstructured":"Fred Kr\u00f6ger. Temporal Logic of Programs, volume 8 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1987."},{"key":"15_CR10","first-page":"657","volume-title":"Information Processing 83: Proceedings of the IFIP 9th World Congress","author":"L. Lamport","year":"1983","unstructured":"Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657\u2013668, Paris, September 1983. IFIP, North-Holland."},{"key":"15_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-57318-6_25","volume-title":"Hybrid Systems","author":"L. Lamport","year":"1993","unstructured":"Leslie Lamport. Hybrid systems in TLA+. In Robert L. Grossman, Anil Nerode, Anders P. Ravn, and Hans Rischel, editors, Hybrid Systems, volume 736 of Lecture Notes in Computer Science, pages 77\u2013102. Springer-Verlag, 1993."},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Leslie Lamport. The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems, 16(3):872\u2013923, May 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR13","series-title":"Technical Note","volume-title":"Refinement in state-based formalisms","author":"L. Lamport","year":"1996","unstructured":"Leslie Lamport. Refinement in state-based formalisms. Technical Note 1996-001, Digital Equipment Corporation, Systems Research Center, Palo Alto, California, December 1996."},{"key":"15_CR14","unstructured":"Stephan Merz. A more complete TLA. Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t M\u00fcnchen. Available on the WWW at URL http:\/\/www.pst.informatik.uni-muenchen.de\/~merz\/papers\/gtla.html , 1999."},{"key":"15_CR15","unstructured":"Stephan Merz. Isabelle\/TLA. Available on the WWW at URL http:\/\/www.pst.informatik.uni-muenchen. de\/~merz\/isabelle\/ , 1997. Revised 1999."},{"key":"15_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/BFb0014000","volume-title":"Temporal Logic (ICTL\u2019 94)","author":"A. Mokkedem","year":"1994","unstructured":"Abdelillah Mokkedem and Dominique M\u00e9ry. A stuttering closed temporal logic for modular reasoning about concurrent programs. In Temporal Logic (ICTL\u2019 94), volume 827 of Lecture Notes in Computer Science, pages 382\u2013397, Bonn, 1994. Springer-Verlag."},{"key":"15_CR17","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Pnueli","year":"1992","unstructured":"Amir Pnueli. System specification and refinement in temporal logic. In R.K. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 1\u201338. Springer-Verlag, 1992."},{"key":"15_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055772","volume-title":"Mathematical Foundations of Computer Science","author":"A. Rabinovich","year":"1998","unstructured":"Alexander Rabinovich. Expressive completeness of temporal logic of action. In L. Brim, J. Gruska, and J. Zlatuska, editors, Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, Brno, Czech Republic, August 1998. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","FM\u201999 \u2014 Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48118-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:29:59Z","timestamp":1556954999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48118-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665885","9783540481188"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48118-4_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}