{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T15:44:01Z","timestamp":1767109441325},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540203636"},{"type":"electronic","value":"9783540397243"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39724-3_28","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:15:55Z","timestamp":1294434955000},"page":"304-318","source":"Crossref","is-referenced-by-count":18,"title":["A Compositional Theory of Refinement for Branching Time"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Manolios","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science\u00a082(2), 253\u2013284 (1991)","journal-title":"Theoretical Computer Science"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Attie, P.C.: Liveness-preserving simulation relations. In: ACM Symposium on the Principles of Distributed Computing (PODC), May 1999, pp. 63-72 (1999)","DOI":"10.1145\/301308.301328"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T. Hasten","year":"1996","unstructured":"Hasten, T.: Branching bisimilarity is an equivalence indeed. Information Processing Letters\u00a058(3), 141\u2013147 (1996)","journal-title":"Information Processing Letters"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-58179-0_44","volume-title":"Computer Aided Verification","author":"J.R. Burch","year":"1994","unstructured":"Burch, J.R., Dill, D.L.: Automatic verification of pipelined microprocessor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 68\u201380. Springer, Heidelberg (1994)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/BFb0024653","volume-title":"FME \u201993: Industrial-Strength Formal Methods","author":"K. Engelhardt","year":"1993","unstructured":"Engelhardt, K., de Roever, W.-P.: Generalizing Abadi & Lamport\u2019s method to solve a problem posed by Pnueli, A. In: Larsen, P.G., Woodcock, J.C.P. (eds.) FME 1993. LNCS, vol.\u00a0670, pp. 294\u2013313. Springer, Heidelberg (1993)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"R.J.v. Glabbeek","year":"2001","unstructured":"Glabbeek, R.J.v.: The linear time - branching time spectrum I; the semantics of concrete, sequential processes. In: Handbook of Process Algebra,\u00a0ch. 1, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"key":"28_CR7","first-page":"453","volume-title":"IEEE Symposium on Foundations of Computer Science","author":"M.R. Henzinger","year":"1995","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: IEEE Symposium on Foundations of Computer Science, pp. 453\u2013462. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45442-X_8","volume-title":"Mathematics of Program Construction","author":"W. Hesselink","year":"2002","unstructured":"Hesselink, W.: Eternity variables to simulate specifications. In: Boiten, E.A., M\u00f6ller, B. (eds.) MPC 2002. LNCS, vol.\u00a02386, pp. 117\u2013130. Springer, Heidelberg (2002)"},{"issue":"2-3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s004460050062","volume":"12","author":"B. Jonsson","year":"1999","unstructured":"Jonsson, B., Pnueli, A., Rump, C.: Proving refinement using transduction. Distributed Computing\u00a012(2-3), 129\u2013149 (1999)","journal-title":"Distributed Computing"},{"volume-title":"Computer-Aided Reasoning: ACL2 Case Studies","year":"2000","key":"28_CR10","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S. (eds.): Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"28_CR11","volume-title":"Computer-Aided Reasoning: An Approach","author":"M. Kaufmann","year":"2000","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"28_CR12","unstructured":"Kaufmann, M., Moore, J.S.: ACL2 homepage, See http:\/\/www.es.-utexas.edu\/users\/moore\/acl2"},{"key":"28_CR13","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Set Theory - An Introduction to Independence Proofs","author":"K. Kunen","year":"1980","unstructured":"Kunen, K.: Set Theory - An Introduction to Independence Proofs. Studies in Logic and the Foundations of Mathematics, vol.\u00a0102. North-Holland, Amsterdam (1980)"},{"key":"28_CR14","first-page":"657","volume":"83","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: What good is temporal logic? Information Processing\u00a083, 657\u2013688 (1983)","journal-title":"Information Processing"},{"issue":"2","key":"28_CR15","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N.A. Lynch","year":"1995","unstructured":"Lynch, N.A., Vaandrager, F.W.: Forward and backward simulations - part I: untimed systems. Information and Computation\u00a0121(2), 214\u2013233 (1995)","journal-title":"Information and Computation"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-40922-X_11","volume-title":"Formal Methods in Computer-Aided Design","author":"P. Manolios","year":"2000","unstructured":"Manolios, P.: Correctness of pipelined machines. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 161\u2013178. Springer, Heidelberg (2000)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48683-6_32","volume-title":"Computer Aided Verification","author":"P. Manolios","year":"1999","unstructured":"Manolios, P., Namjoshi, K., Sumners, R.: Linking theorem proving and model-checking with well-founded bisimulation. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 369\u2013379. Springer, Heidelberg (1999)"},{"key":"28_CR18","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1990","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1990)"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/BFb0058037","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"K.S. Namjoshi","year":"1997","unstructured":"Namjoshi, K.S.: A simple characterization of stuttering bisimulation. In: Ramesh, S., Sivakumar, G. (eds.) FST TCS 1997. LNCS, vol.\u00a01346, pp. 284\u2013296. Springer, Heidelberg (1997)"},{"issue":"6","key":"28_CR20","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":"28_CR21","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":"28_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/SFCS.1977.32","volume-title":"18th Annual Symposium on Foundations of Computer Science","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, pp. 46\u201357. IEEE, Los Alamitos (1977)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BFb0015727","volume-title":"Automata, Languages and Programming","author":"A. Pnueli","year":"1985","unstructured":"Pnueli, A.: Linear and branching structures in the semantics and logics of reactive systems. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 15\u201332. Springer, Heidelberg (1985)"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Sawada, J.: Formal Verification of an Advanced Pipelined Machine. PhD thesis, University of Texas at Austin (December 1999)","DOI":"10.1007\/978-1-4757-3188-0_9"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Sawada, J.: Verification of a simple pipelined machine model. In: Kaufmann et al. [10], pp. 137\u2013150","DOI":"10.1007\/978-1-4757-3188-0_9"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: STOC: ACM Symposium on Theory of Computing (STOC), pp. 1-9 (1973)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","Correct Hardware Design and Verification Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39724-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:03:32Z","timestamp":1559916212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39724-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540203636","9783540397243"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39724-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}