{"id":"https://openalex.org/W2150196040","doi":"https://doi.org/10.1016/j.entcs.2004.11.028","title":"Equivalences for Silent Transitions in Probabilistic Systems","display_name":"Equivalences for Silent Transitions in Probabilistic Systems","publication_year":2005,"publication_date":"2005-04-01","ids":{"openalex":"https://openalex.org/W2150196040","doi":"https://doi.org/10.1016/j.entcs.2004.11.028","mag":"2150196040"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2004.11.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.11.028","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066105001544/pdf","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://www.sciencedirect.com/science/article/pii/S1571066105001544/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022490005","display_name":"Suzana Andova","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"S. Andova","raw_affiliation_strings":["Department of Computer Science, Twente University, P.O. Box 217, 7500 AE Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Twente University, P.O. Box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042194099","display_name":"Tim A. C. Willemse","orcid":"https://orcid.org/0000-0003-3049-7962"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"T.A.C. Willemse","raw_affiliation_strings":["Nijmegen Institute for Computing and Information Sciences (NIII), Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nijmegen Institute for Computing and Information Sciences (NIII), Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042194099"],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":null,"apc_paid":null,"fwci":1.0106,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.84589623,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"128","issue":"2","first_page":"53","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9912999868392944,"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"}},"topics":[{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9912999868392944,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9595999717712402,"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/T10142","display_name":"Formal Methods in Verification","score":0.9010000228881836,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.8548383712768555},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7348463535308838},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6064927577972412},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5505960583686829},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.462035208940506},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.43057310581207275},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3351619243621826},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.08385986089706421}],"concepts":[{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.8548383712768555},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7348463535308838},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6064927577972412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5505960583686829},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.462035208940506},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.43057310581207275},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3351619243621826},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.08385986089706421},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1016/j.entcs.2004.11.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.11.028","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066105001544/pdf","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:pure.tue.nl:openaire_cris_publications/80852fab-f0bf-4c34-a789-37c4d2b1c278","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/80852fab-f0bf-4c34-a789-37c4d2b1c278","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Andova, S & Willemse, T A C 2005, Equivalences for silent transitions in probilistic systems. in J C M Baeten & F Corradini (eds), Proceedings 11th International Workshop on Expressiveness in Concurrency (EXPRESS 2004, London, UK, August 30, 2004). Electronic Notes in Theoretical Computer Science, vol. 128(2), pp. 53-66. https://doi.org/10.1016/j.entcs.2004.11.028","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/32472","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/32472","pdf_url":"http://hdl.handle.net/2066/32472","source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Notes in Theoretical Computer Science, 128, 2, pp. 53-66","raw_type":"Article / Letter to editor"},{"id":"pmh:oai:ris.utwente.nl:openaire/f5e74bf3-ea31-425e-b7b8-672a0fe7aad6","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/f5e74bf3-ea31-425e-b7b8-672a0fe7aad6","pdf_url":"https://ris.utwente.nl/ws/files/6531176/Andova05equivalences.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Andova, S & Willemse, T A C 2005, 'Equivalences for Silent Transitions in Probabilistic Systems (Extended Abstract)', Electronic notes in theoretical computer science, vol. 128, no. 2, pp. 53-66. https://doi.org/10.1016/j.entcs.2004.11.028","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/f5e74bf3-ea31-425e-b7b8-672a0fe7aad6","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/80852fab-f0bf-4c34-a789-37c4d2b1c278","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/80852fab-f0bf-4c34-a789-37c4d2b1c278","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings 11th International Workshop on Expressiveness in Concurrency (EXPRESS 2004, London, UK, August 30, 2004), 53 - 66","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2004.11.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.11.028","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066105001544/pdf","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":[{"score":0.75,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2150196040.pdf","grobid_xml":"https://content.openalex.org/works/W2150196040.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W138290785","https://openalex.org/W1489359924","https://openalex.org/W1504378062","https://openalex.org/W1505118248","https://openalex.org/W1577673148","https://openalex.org/W1579183220","https://openalex.org/W1704074244","https://openalex.org/W1736113712","https://openalex.org/W1793726001","https://openalex.org/W1810681804","https://openalex.org/W1850900101","https://openalex.org/W1976268573","https://openalex.org/W1985161650","https://openalex.org/W2120926795","https://openalex.org/W2165161585","https://openalex.org/W6605686872","https://openalex.org/W6629177793","https://openalex.org/W6634676695","https://openalex.org/W6637163446","https://openalex.org/W6637888984","https://openalex.org/W6638247452","https://openalex.org/W6684551565"],"related_works":["https://openalex.org/W2462424100","https://openalex.org/W2148974013","https://openalex.org/W2034871982","https://openalex.org/W2130873474","https://openalex.org/W1983409968","https://openalex.org/W2034850439","https://openalex.org/W2045155990","https://openalex.org/W1974919125","https://openalex.org/W2022364537","https://openalex.org/W1971383138"],"abstract_inverted_index":{"We":[0,49],"address":[1],"abstraction":[2],"in":[3,86,101,105],"the":[4,16,24,96,102,106,112],"setting":[5],"of":[6,26,70,79,98],"probabilistic":[7],"reactive":[8],"systems,":[9],"and":[10,29,43,65,104,110],"study":[11,30],"its":[12,31],"formal":[13],"underpinnings":[14],"for":[15,91],"strictly":[17],"alternating":[18,103],"model.":[19],"In":[20],"particular,":[21],"we":[22],"define":[23],"notion":[25],"branching":[27,44,56,71,80,99,121],"bisimilarity":[28,45,100],"properties":[32],"by":[33],"studying":[34],"two":[35],"other":[36],"equivalence":[37,42],"relations,":[38],"viz.":[39],"coloured":[40],"trace":[41],"using":[46],"maximal":[47],"probabilities.":[48],"show":[50],"that":[51,95,111,118],"both":[52],"alternatives":[53],"coincide":[54],"with":[55],"bisimilarity.":[57,72,81],"The":[58],"alternative":[59],"characterisations":[60],"have":[61],"their":[62],"own":[63],"merits":[64],"focus":[66],"on":[67],"different":[68],"aspects":[69],"Together":[73],"they":[74],"give":[75],"a":[76,88],"better":[77],"understanding":[78],"A":[82],"crucial":[83],"observation,":[84],"and,":[85],"fact":[87],"major":[89],"motivation":[90],"this":[92],"work":[93],"is":[94],"notions":[97],"non-alternating":[107],"model":[108],"differ,":[109],"latter":[113],"one":[114],"discriminates":[115],"between":[116],"systems":[117],"are":[119],"intuitively":[120],"bisimilar.":[122]},"counts_by_year":[],"updated_date":"2026-08-24T07:32:12.397491","created_date":"2016-06-24T00:00:00"}