{"id":"https://openalex.org/W2078717493","doi":"https://doi.org/10.1016/s1571-0661(04)00121-5","title":"A Testing Equivalence for Reactive Probabilistic Processes","display_name":"A Testing Equivalence for Reactive Probabilistic Processes","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2078717493","doi":"https://doi.org/10.1016/s1571-0661(04)00121-5","mag":"2078717493"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)00121-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00121-5","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)00121-5","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081710233","display_name":"Marta Kwiatkowska","orcid":"https://orcid.org/0000-0001-9022-7599"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M.Z. Kwiatkowska","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067544120","display_name":"Gethin Norman","orcid":"https://orcid.org/0000-0001-9326-4344"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"G.J. Norman","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081710233"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":1.5253,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.83073845,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"2","first_page":"114","last_page":"132"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.915942370891571},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.8716726899147034},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7220363616943359},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.6698051691055298},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5846382975578308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5007495880126953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4221958816051483},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4162839651107788},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35590672492980957},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3123663365840912},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08654186129570007}],"concepts":[{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.915942370891571},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8716726899147034},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7220363616943359},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.6698051691055298},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5846382975578308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5007495880126953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4221958816051483},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4162839651107788},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35590672492980957},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3123663365840912},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08654186129570007}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)00121-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00121-5","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.9257","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.9257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.bham.ac.uk/pub/authors/M.Z.Kwiatkowska/express98.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)00121-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00121-5","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W122003833","https://openalex.org/W122791382","https://openalex.org/W138290785","https://openalex.org/W173641204","https://openalex.org/W258022877","https://openalex.org/W1482332845","https://openalex.org/W1489099913","https://openalex.org/W1497670448","https://openalex.org/W1503973138","https://openalex.org/W1579183220","https://openalex.org/W1586460111","https://openalex.org/W1601373402","https://openalex.org/W1793726001","https://openalex.org/W1865728679","https://openalex.org/W1935088456","https://openalex.org/W1972478730","https://openalex.org/W1976268573","https://openalex.org/W1978469611","https://openalex.org/W2012100616","https://openalex.org/W2030875267","https://openalex.org/W2090942994","https://openalex.org/W2098737431","https://openalex.org/W2098981343","https://openalex.org/W2100781580","https://openalex.org/W2102097307","https://openalex.org/W2129384397","https://openalex.org/W2135795876","https://openalex.org/W2167004912","https://openalex.org/W4212872794","https://openalex.org/W4239721096","https://openalex.org/W4242441073","https://openalex.org/W4285719527","https://openalex.org/W6643417512","https://openalex.org/W6679059954"],"related_works":["https://openalex.org/W4250946489","https://openalex.org/W1511744714","https://openalex.org/W2125381826","https://openalex.org/W1820233200","https://openalex.org/W3144317787","https://openalex.org/W2124122503","https://openalex.org/W1569743961","https://openalex.org/W1540576960","https://openalex.org/W2171788740","https://openalex.org/W1586382855"],"abstract_inverted_index":{"We":[0,28,113],"consider":[1],"a":[2,57,83,86,115],"generalisation":[3],"of":[4,17,54,88,118,123,127,129],"Larsen":[5],"and":[6,24,33,104,131],"Skou's":[7],"[19]":[8],"reactive":[9],"probabilistic":[10,20,93,99,107],"transition":[11],"systems":[12],"which":[13],"exhibit":[14],"three":[15],"kinds":[16],"choice:":[18],"action-guarded":[19,92],"choice,":[21],"external":[22],"(deterministic)":[23],"internal":[25],"(non-deterministic)":[26],"choice.":[27,94],"propose":[29],"an":[30],"operational":[31],"preorder":[32],"equivalence":[34,69,81,120],"for":[35,85,110],"processes":[36,55,60],"based":[37],"on":[38],"testing.":[39],"Milner's":[40],"button":[41],"pushing":[42],"experiments":[43,49],"scenario":[44],"is":[45,82,96],"extended":[46,90],"with":[47,64,75,91],"random":[48],"by":[50],"assessing":[51],"the":[52,67,76,119,124,140],"probability":[53],"passing":[56],"test.":[58],"Two":[59],"are":[61],"then":[62],"identified":[63],"respect":[65],"to":[66,139],"testing":[68],"if":[70],"they":[71],"pass":[72],"all":[73],"tests":[74],"same":[77],"probability.":[78],"The":[79],"derived":[80],"congruence":[84],"subcalculus":[87],"CSP":[89,111],"It":[95],"coarser":[97],"than":[98],"bisimulation,":[100],"yet":[101],"non-probabilistic":[102],"branching-time,":[103],"differs":[105],"from":[106],"equivalences":[108],"developed":[109],"[20,22,26].":[112],"provide":[114],"logical":[116],"characterization":[117],"in":[121],"terms":[122],"quantitative":[125],"interpretation":[126],"HML":[128],"[14]":[130],"show":[132],"how":[133],"fixed":[134],"points":[135],"can":[136],"be":[137],"added":[138],"logic.":[141]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}