{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:12:16Z","timestamp":1726035136450},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214845"},{"type":"electronic","value":"9783030214852"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21485-2_5","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T14:04:18Z","timestamp":1562162658000},"page":"45-70","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reward Testing Equivalences for Processes"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,3]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic and Computer Science, vol. 3, pp. 1\u2013168. Clarendon Press (1994)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. Inf. Process. Lett. 21(4), 181\u2013185 (1985). https:\/\/doi.org\/10.1016\/0020-0190(85)90056-0","journal-title":"Inf. Process. Lett."},{"key":"5_CR3","unstructured":"Bergstra, J.A., Klop, J.W., Olderog, E.-R.: Failures without chaos: a new process semantics for fair abstraction. In: Wirsing, M. (ed.) Formal Description of Programming Concepts - III, Proceedings of the $$3^{th}$$ IFIP WG 2.2 Working Conference, Ebberup 1986, North-Holland, Amsterdam, pp. 77\u2013103 (1987)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-60218-6_23","volume-title":"CONCUR \u201995: Concurrency Theory","author":"E Brinksma","year":"1995","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 313\u2013327. Springer, Berlin (1995). https:\/\/doi.org\/10.1007\/3-540-60218-6_23"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.2168\/LMCS-11(3:17)2015","volume":"11","author":"T Chen","year":"2015","unstructured":"Chen, T., Fokkink, W.J., van Glabbeek, R.J.: On the axiomatizability of impossible futures. Logical Methods Comput. Sci. 11(3), 17 (2015). https:\/\/doi.org\/10.2168\/LMCS-11(3:17)2015","journal-title":"Logical Methods Comput. Sci."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83\u2013133 (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90113-0","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.2168\/LMCS-4(4:4)2008","volume":"4","author":"Y Deng","year":"2008","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C.: Characterising testing preorders for finite probabilistic processes. Logical Methods Comput. Sci. 4(4), 4 (2008). https:\/\/doi.org\/10.2168\/LMCS-4(4:4)2008","journal-title":"Logical Methods Comput. Sci."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2013.07.016","volume":"538","author":"Y Deng","year":"2014","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C.: Real-reward testing for probabilistic processes. Theor. Comput. Sci. 538, 16\u201336 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.07.016","journal-title":"Theor. Comput. Sci."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.entcs.2007.02.013","volume":"172","author":"Yuxin Deng","year":"2007","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C., Zhang, C.: Remarks on testing probabilistic processes. In: Cardelli, L., Fiore, M., Winskel, G. (eds.) Computation, Meaning, and Logic: Articles Dedicated to Gordon Plotkin, ENTCS, vol. 172, pp. 359\u2013397. Elsevier (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.013","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-71316-6_25","volume-title":"Programming Languages and Systems","author":"Y Deng","year":"2007","unstructured":"Deng, Y., van Glabbeek, R., Morgan, C., Zhang, C.: Scalar outcomes suffice for finitary probabilistic testing. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 363\u2013378. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_25"},{"key":"5_CR11","unstructured":"van Glabbeek, R.J.: The Linear Time \u2013 Branching time spectrum after 20 years, or full abstraction for safety and liveness properties. Copies of slides. Invited talk for IFIP WG 1.8 at CONCUR 2009 in Bologna (2009). http:\/\/theory.stanford.edu\/~rvg\/abstracts.html#20years"},{"key":"5_CR12","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-15240-5_3","volume-title":"Theoretical Computer Science","author":"RJ van Glabbeek","year":"2010","unstructured":"van Glabbeek, R.J.: The coarsest precongruences respecting safety and liveness properties. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIPAICT, vol. 323, pp. 32\u201352. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-15240-5_3"},{"key":"5_CR13","unstructured":"van Glabbeek, R.J.: Ensuring liveness properties of distributed systems (a research agenda). Position paper (2016). https:\/\/arxiv.org\/abs\/1711.04240"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Lean and full congruence formats for recursion. In: Proceedings $$32^{nd}$$ Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 2017. IEEE Computer Society Press (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005142","DOI":"10.1109\/LICS.2017.8005142"},{"key":"5_CR15","unstructured":"van Glabbeek, R.J., H\u00f6fner, P.: Progress, fairness and justness in process algebra. Technical Report 8501, NICTA, Sydney, Australia (2015). http:\/\/arxiv.org\/abs\/1501.03268"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-11494-7_13","volume-title":"International Symposium on Programming","author":"MCB Hennessy","year":"1982","unstructured":"Hennessy, M.C.B.: Powerdomains and nondeterministic recursive definitions. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137, pp. 178\u2013193. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/3-540-11494-7_13"},{"key":"5_CR17","volume-title":"An Algebraic Theory of Processes","author":"M Hennessy","year":"1988","unstructured":"Hennessy, M.: An Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-58468-4_176","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"B Jonsson","year":"1994","unstructured":"Jonsson, B., Ho-Stuart, C., Yi, W.: Testing and refinement for nondeterministic and probabilistic processes. In: Langmaack, H., de Roever, W.P., Vytopil, J. (eds.) FTRTFT 1994, ProCoS 1994. Lecture Notes in Computer Science, vol. 863, pp. 418\u2013430. Springer, Berlin (1994). https:\/\/doi.org\/10.1007\/3-540-58468-4_176"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BFb0084793","volume-title":"CONCUR \u201992","author":"R Kaivola","year":"1992","unstructured":"Kaivola, R., Valmari, A.: The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 207\u2013221. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0084793"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. 3(2), 125\u2013143 (1977). https:\/\/doi.org\/10.1109\/TSE.1977.229904","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1\u20132","key":"5_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0304-3975(98)00129-7","volume":"206","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: Proving possibility properties. Theor. Comput. Sci. 206(1\u20132), 341\u2013352 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(98)00129-7 . http:\/\/research.microsoft.com\/en-us\/um\/people\/lamport\/pubs\/pubs.html#lamport-possibility","journal-title":"Theor. Comput. Sci."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Leduc, G.: Failure-based congruences, unfair divergences and new testing theory. In: Vuong, S.T., Chanson, S.T. (eds.) 1994 Proceedings Fourteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, Vancouver, BC, Canada, IFIP Conference Proceedings, vol. 1, pp. 252\u2013267. Chapman & Hall (1994)","DOI":"10.1007\/978-0-387-34867-4_17"},{"issue":"2\u20133","key":"5_CR23","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.apal.2007.10.007","volume":"151","author":"PB Levy","year":"2008","unstructured":"Levy, P.B.: Infinite trace equivalence. Ann. Pure Appl. Logic 151(2\u20133), 170\u2013198 (2008). https:\/\/doi.org\/10.1016\/j.apal.2007.10.007","journal-title":"Ann. Pure Appl. Logic"},{"key":"5_CR24","first-page":"1201","volume-title":"Formal Models and Semantics","author":"Robin MILNER","year":"1990","unstructured":"Milner, R.: Operational and algebraic semantics of concurrent processes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Elsevier Science Publishers B.V. (North-Holland), pp. 1201\u20131242 (1990). (Chap. 19) Communication and Concurrency, Prentice-Hall, Englewood Cliffs, 1989"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/3-540-60084-1_112","volume-title":"Automata, Languages and Programming","author":"V Natarajan","year":"1995","unstructured":"Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 648\u2013659. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60084-1_112"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E-R Olderog","year":"1986","unstructured":"Olderog, E.-R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes. Acta Informatica 23, 9\u201366 (1986). https:\/\/doi.org\/10.1007\/BF00268075","journal-title":"Acta Informatica"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-45500-0_20","volume-title":"Theoretical Aspects of Computer Software","author":"A Puhakka","year":"2001","unstructured":"Puhakka, A.: Weakest congruence results concerning \u201cany-lock\u201d. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 400\u2013419. Springer, Berlin (2001). https:\/\/doi.org\/10.1007\/3-540-45500-0_20"},{"key":"5_CR28","volume-title":"The Theory and Practice of Concurrency","author":"AW Roscoe","year":"1997","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Upper Saddle River (1997). http:\/\/www.comlab.ox.ac.uk\/bill.roscoe\/publications\/68b.pdf"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11423348_2","volume-title":"Communicating Sequential Processes. The First 25 Years","author":"AW Roscoe","year":"2005","unstructured":"Roscoe, A.W.: Seeing beyond divergence. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. The First 25 Years. Lecture Notes in Computer Science, vol. 3525, pp. 15\u201335. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/11423348_2"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-61604-7_62","volume-title":"CONCUR \u201996: Concurrency Theory","author":"R Segala","year":"1996","unstructured":"Segala, R.: Testing probabilistic automata. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 299\u2013314. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61604-7_62"},{"issue":"1\u20132","key":"5_CR31","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/S0304-3975(01)00300-0","volume":"275","author":"W Vogler","year":"2002","unstructured":"Vogler, W.: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theor. Comput. Sci. 275(1\u20132), 589\u2013631 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00300-0","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Models, Languages, and Tools for Concurrent and Distributed Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21485-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T15:50:37Z","timestamp":1721490637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21485-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214845","9783030214852"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21485-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}