{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T12:32:04Z","timestamp":1790944324161,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540555643","type":"print"},{"value":"9783540472186","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/bfb0032002","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:36:29Z","timestamp":1134264989000},"page":"397-446","source":"Crossref","is-referenced-by-count":60,"title":["Forward and backward simulations for timing-based systems"],"prefix":"10.1007","author":[{"given":"Nancy","family":"Lynch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"issue":"82","key":"18_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"2","author":"M. Abadi","year":"1991","unstructured":"M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 2(82):253\u2013284, 1991.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J.C.M. Baeten","year":"1991","unstructured":"J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Journal of Formal Aspects of Computing Science, 3(2):142\u2013188, 1991.","journal-title":"Journal of Formal Aspects of Computing Science"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"G. Berry and L. Cosserat. The ESTEREL synchronous programming language and its mathematical semantics. In A.W. Roscoe & G. Winskel S.D. Brookes, editor, Seminar on Concurrency, volume 197 of Lecture Notes in Computer Science, pages 389\u2013448. Springer-Verlag, 1984.","DOI":"10.1007\/3-540-15670-4_19"},{"key":"18_CR4","unstructured":"R. Gerber and I. Lee. The formal treatment of priorities in real-time computation. In Proceedings 6th IEEE Workshop on Real-Time Software and Operating Systems, 1989."},{"key":"18_CR5","volume-title":"REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness","author":"R. Gerth","year":"1989","unstructured":"R. Gerth. Foundations of compositional program refinement (first version). In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands 1989, volume 430 of Lecture Notes in Computer Science, pages 777\u2013560. Springer-Verlag, 1990."},{"key":"18_CR6","volume-title":"Algebraic Theory of Automata","author":"A. Ginzburg","year":"1968","unstructured":"A. Ginzburg. Algebraic Theory of Automata. Academic Press, New York-London, 1968."},{"key":"18_CR7","volume-title":"Report CS-R9015","author":"J.F. Groote","year":"1990","unstructured":"J.F. Groote. Specification and verification of real time systems in ACP. Report CS-R9015, CWI, Amsterdam, 1990. An extended abstract appeared in L. Logrippo, R.L. Probert and H. Ural, editors, Proceedings 10th International Symposium on Protocol Specification, Testing and Verification, Ottawa, pages 261\u2013274, 1990."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01887207","volume":"1","author":"J. He","year":"1989","unstructured":"J. He. Process simulation and refinement. Journal of Formal Aspects of Computing Science, 1:229\u2013241, 1989.","journal-title":"Journal of Formal Aspects of Computing Science"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(87)90224-9","volume":"25","author":"G.A.R. Hoare","year":"1987","unstructured":"G.A.R. Hoare, J. He, and J.W. Sanders. Prespecification in data refinement. Information Processing Letters, 25:71\u201376, 1987.","journal-title":"Information Processing Letters"},{"key":"18_CR10","unstructured":"B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Department of Computer Systems, Uppsala University, 1987. DoCS 87\/09."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"B. Jonsson. Modular verification of asynchronous networks. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, pages 152\u2013166, 1987.","DOI":"10.1145\/41840.41853"},{"key":"18_CR12","volume-title":"REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness","author":"B. Jonsson","year":"1989","unstructured":"B. Jonsson. On decomposing and refining specifications of distributed systems. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands 1989, volume 430 of Lecture Notes in Computer Science, pages 361\u2013387. Springer-Verlag, 1990."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"B. Jonsson. Simulations between specifications of distributed systems. In J.C.M. Baeten and J.F. Groote, editors, Proceedings CONCUR 91, Amsterdam, volume 527 of Lecture Notes in Computer Science, pages 346\u2013360. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54430-5_99"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01788563","volume":"3","author":"M.B. Josephs","year":"1988","unstructured":"M.B. Josephs. A state-based approach to communicating processes. Distributed Computing, 3:9\u201318, 1988.","journal-title":"Distributed Computing"},{"key":"18_CR15","volume-title":"Technical Report 89-1039","author":"N. Klarlund","year":"1989","unstructured":"N. Klarlund and F.B. Schneider. Verifying safety properties using infinite-state automata. Technical Report 89-1039, Department of Computer Science, Cornell University, Ithaca, New York, 1989."},{"key":"18_CR16","volume-title":"Fundamental Algorithms, volume 1 of The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, 1973. Second edition.","edition":"Second edition"},{"issue":"2","key":"18_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L. Lamport","year":"1983","unstructured":"L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2):190\u2013222, 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR18","volume-title":"REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness","author":"N.A. Lynch","year":"1989","unstructured":"N.A. Lynch. Multivalued possibilities mappings. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands 1989, volume 430 of Lecture Notes in Computer Science, pages 519\u2013543. Springer-Verlag, 1990."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"N.A. Lynch and H. Attiya. Using mappings to prove timing properties. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec, Canada, August 1990. Expanded version: Technical Memo MIT\/LCS\/TM-412.C, Laboratory for Computer Science, MIT, March 1991. Submitted for publication.","DOI":"10.1145\/93385.93428"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, pages 137\u2013151, August 1987. A full version is available as MIT Technical Report MIT\/LCS\/TR-387.","DOI":"10.1145\/41840.41852"},{"key":"18_CR21","volume-title":"REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness","author":"M. Merritt","year":"1989","unstructured":"M. Merritt. Completeness theorems for automata. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands 1989, volume 430 of Lecture Notes in Computer Science, pages 544\u2013560. Springer-Verlag, 1990."},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"M. Merritt, F. Modugno, and M. Tuttle. Time constrained automata. In J.C.M. Baeten and J.F. Groote, editors, Proceedings CONCUR 91, Amsterdam, volume 527 of Lecture Notes in Computer Science, pages 408\u2013423. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54430-5_103"},{"key":"18_CR23","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 401\u2013415. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0039073"},{"key":"18_CR25","unstructured":"X. Nicollin, J.-L. Richier, J. Sifakis, and J. Voiron. ATP: An algebra for timed processes. In M. Broy and C.B. Jones, editors, Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Gallilea, Israel, pages 402\u2013429, 1990."},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems, 1991. This volume.","DOI":"10.1007\/BFb0032007"},{"issue":"4","key":"18_CR27","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6(4):319\u2013340, 1976.","journal-title":"Acta Informatica"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(88)90030-8","volume":"58","author":"G.M. Reed","year":"1988","unstructured":"G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, 58:249\u2013261, 1988.","journal-title":"Theoretical Computer Science"},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(86)90007-1","volume":"56","author":"E. W. Stark","year":"1988","unstructured":"E. W. Stark. Proving entailment between conceptual state specifications. Theoretical Computer Science, 56:135\u2013154, 1988.","journal-title":"Theoretical Computer Science"},{"key":"18_CR31","unstructured":"F.W. Vaandrager and N.A. Lynch. Process algebras for timed automata, 1991. In preparation."},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Wang Yi. Real-time behaviour of asynchronous agents. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 502\u2013520. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0039080"},{"key":"18_CR33","unstructured":"A. Zwarico. Timed Acceptance: An Algebra of Time Dependent Computing. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, 1988."}],"container-title":["Lecture Notes in Computer Science","Real-Time: Theory in Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:48:01Z","timestamp":1586598481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540555643","9783540472186"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/bfb0032002","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}