{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:23Z","timestamp":1759638563080,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030598532"},{"type":"electronic","value":"9783030598549"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59854-9_5","type":"book-chapter","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T23:02:42Z","timestamp":1604358162000},"page":"35-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Alternative Characterizations of\u00a0Probabilistic Trace Equivalences on\u00a0Coherent Resolutions of\u00a0Nondeterminism"],"prefix":"10.1007","author":[{"given":"Marco","family":"Bernardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,3]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C Baier","year":"2005","unstructured":"Baier, C., Katoen, J.P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Inf. Comput. 200, 149\u2013214 (2005)","journal-title":"Inf. Comput."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-030-44411-2_2","volume-title":"Computer Performance Engineering","author":"M Bernardo","year":"2020","unstructured":"Bernardo, M.: Coherent resolutions of nondeterminism. In: Gribaudo, M., Iacono, M., Phung-Duc, T., Razumchik, R. (eds.) EPEW 2019. LNCS, vol. 12039, pp. 16\u201332. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44411-2_2"},{"issue":"116","key":"5_CR3","first-page":"1","volume":"10","author":"M Bernardo","year":"2014","unstructured":"Bernardo, M., De Nicola, R., Loreti, M.: Revisiting trace and testing equivalences for nondeterministic and probabilistic processes. Logical Methods Comput. Sci. 10(116), 1\u201342 (2014)","journal-title":"Logical Methods Comput. Sci."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2014.03.001","volume":"546","author":"M Bernardo","year":"2014","unstructured":"Bernardo, M., De Nicola, R., Loreti, M.: Relating strong behavioral equivalences for processes with nondeterminism and probabilities. Theoret. Comput. Sci. 546, 63\u201392 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-10696-0_23","volume-title":"Quantitative Evaluation of Systems","author":"M Bernardo","year":"2014","unstructured":"Bernardo, M., Sangiorgi, D., Vignudelli, V.: On the discriminating power of testing equivalences for reactive probabilistic systems: results and open problems. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 281\u2013296. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10696-0_23"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 499\u2013513. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60692-0_70"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Sokolova, A., Vignudelli, V.: The theory of traces for systems with nondeterminism and probability. In: Proceedings of the 34th ACM\/IEEE Symposium on Logic in Computer Science (LICS 2019), pp. (19:62)1\u201314. IEEE-CS Press (2019)","DOI":"10.1109\/LICS.2019.8785673"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31, 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2006.07.033","volume":"365","author":"L Cheung","year":"2006","unstructured":"Cheung, L., Lynch, N.A., Segala, R., Vaandrager, F.: Switched PIOA: parallel composition via distributed scheduling. Theoret. Comput. Sci. 365, 83\u2013108 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44685-0_24","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"L de Alfaro","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 351\u2013365. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_24"},{"issue":"4:4","key":"5_CR11","first-page":"1","volume":"4","author":"Y Deng","year":"2008","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Characterising testing preorders for finite probabilistic processes. Logical Methods Comput. Sci. 4(4:4), 1\u201333 (2008)","journal-title":"Logical Methods Comput. Sci."},{"key":"5_CR12","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, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_25"},{"key":"5_CR13","volume-title":"Finite State Markovian Decision Processes","author":"C Derman","year":"1970","unstructured":"Derman, C.: Finite State Markovian Decision Processes. Academic Press, Cambridge (1970)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00165-012-0236-5","volume":"24","author":"S Georgievska","year":"2012","unstructured":"Georgievska, S., Andova, S.: Probabilistic may\/must testing: retaining probabilities by restricted schedulers. Formal Aspects Comput. 24, 727\u2013748 (2012). https:\/\/doi.org\/10.1007\/s00165-012-0236-5","journal-title":"Formal Aspects Comput."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Giro, S., D\u2019Argenio, P.R.: On the expressive power of schedulers in distributed probabilistic systems. In: Proceedings of the 7th International Workshop on Quantitative Aspects of Programming Languages (QAPL 2009), ENTCS, vol. 253(3), pp. 45\u201371. Elsevier (2009)","DOI":"10.1016\/j.entcs.2009.10.005"},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3233\/FI-1992-17304","volume":"17","author":"DT Huynh","year":"1992","unstructured":"Huynh, D.T., Tian, L.: On some equivalence relations for probabilistic processes. Fundamenta Informaticae 17, 211\u2013234 (1992)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR17","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. LNCS, vol. 863, pp. 418\u2013430. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58468-4_176"},{"key":"5_CR18","unstructured":"Jonsson, B., Yi, W.: Compositional testing preorders for probabilistic processes. In: Proceedings of the 10th IEEE Symposium on Logic in Computer Science (LICS 1995), pp. 431\u2013441. IEEE-CS Press (1995)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(01)00044-5","volume":"282","author":"B Jonsson","year":"2002","unstructured":"Jonsson, B., Yi, W.: Testing preorders for probabilistic processes can be characterized by simulations. Theoret. Comput. Sci. 282, 33\u201351 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"C-C Jou","year":"1990","unstructured":"Jou, C.-C., Smolka, S.A.: Equivalences, congruences, and complete axiomatizations for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 367\u2013383. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039071"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19, 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"key":"5_CR22","volume-title":"Finite Markov Chains","author":"JG Kemeny","year":"1960","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Van Nostrand, London (1960)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45187-7_14","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N Lynch","year":"2003","unstructured":"Lynch, N., Segala, R., Vaandrager, F.: Compositionality for probabilistic automata. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 208\u2013221. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45187-7_14"},{"key":"5_CR24","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. Ph.D. thesis (1995)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-60218-6_17","volume-title":"CONCUR \u201995: Concurrency Theory","author":"R Segala","year":"1995","unstructured":"Segala, R.: A compositional trace-based semantics for probabilistic automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 234\u2013248. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60218-6_17"},{"key":"5_CR26","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"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-48654-1_35","volume-title":"CONCUR 1994: Concurrency Theory","author":"R Segala","year":"1994","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 481\u2013496. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_35"},{"key":"5_CR28","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum I. In: Handbook of Process Algebra, pp. 3\u201399. Elsevier (2001)"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"RJ van Glabbeek","year":"1995","unstructured":"van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Inf. Comput. 121, 59\u201380 (1995)","journal-title":"Inf. Comput."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (FOCS 1985), pp. 327\u2013338. IEEE-CS Press (1985)","DOI":"10.1109\/SFCS.1985.12"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Proceedings of the 12th International Symposium on Protocol Specification, Testing and Verification (PSTV 1992), pp. 47\u201361. North-Holland (1992)","DOI":"10.1016\/B978-0-444-89874-6.50010-6"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59854-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,26]],"date-time":"2022-11-26T08:00:58Z","timestamp":1669449658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59854-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030598532","9783030598549"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59854-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.qest.org\/qest2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,10","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,06","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}