{"id":"https://openalex.org/W2010586473","doi":"https://doi.org/10.1007/s00165-012-0236-5","title":"Probabilistic may/must testing: retaining probabilities by restricted schedulers","display_name":"Probabilistic may/must testing: retaining probabilities by restricted schedulers","publication_year":2012,"publication_date":"2012-06-28","ids":{"openalex":"https://openalex.org/W2010586473","doi":"https://doi.org/10.1007/s00165-012-0236-5","mag":"2010586473"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-012-0236-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-012-0236-5","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-012-0236-5","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-012-0236-5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060758353","display_name":"Sonja Georgievska","orcid":"https://orcid.org/0000-0002-8094-4532"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sonja Georgievska","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600\u00a0MB, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600\u00a0MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022490005","display_name":"Suzana Andova","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Suzana Andova","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600\u00a0MB, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600\u00a0MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060758353"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":3.1151,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.91558844,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"24","issue":"4-6","first_page":"727","last_page":"748"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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/T10237","display_name":"Cryptography and Data Security","score":0.9944000244140625,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9894999861717224,"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.9233735203742981},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.8092743158340454},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6657925844192505},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6537769436836243},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5604234337806702},{"id":"https://openalex.org/keywords/principle-of-compositionality","display_name":"Principle of compositionality","score":0.5574288964271545},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.5216425061225891},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40052103996276855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3167223036289215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27923789620399475},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.161058247089386},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0947674810886383}],"concepts":[{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.9233735203742981},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8092743158340454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6657925844192505},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6537769436836243},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5604234337806702},{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.5574288964271545},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.5216425061225891},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40052103996276855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3167223036289215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27923789620399475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.161058247089386},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0947674810886383},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00165-012-0236-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-012-0236-5","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-012-0236-5","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/23268989-85cf-435b-b52f-51c5e9487cb3","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/23268989-85cf-435b-b52f-51c5e9487cb3","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Georgievska, S & Andova, S 2012, 'Probabilistic may/must testing: retaining probabilities by restricted schedulers', Formal Aspects of Computing, vol. 24, no. 4-6, pp. 727-748. https://doi.org/10.1007/s00165-012-0236-5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/23268989-85cf-435b-b52f-51c5e9487cb3","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/23268989-85cf-435b-b52f-51c5e9487cb3","pdf_url":"https://research.tue.nl/nl/publications/23268989-85cf-435b-b52f-51c5e9487cb3","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Formal Aspects of Computing, 24(4-6), 727 - 748. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:736944","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=736944","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"ISSN:0934-5043","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:736944","is_oa":false,"landing_page_url":"http://repository.tue.nl/736944","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"ISSN:0934-5043","raw_type":"Article / Letter to the editor"}],"best_oa_location":{"id":"doi:10.1007/s00165-012-0236-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-012-0236-5","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-012-0236-5","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2010586473.pdf","grobid_xml":"https://content.openalex.org/works/W2010586473.grobid-xml"},"referenced_works_count":69,"referenced_works":["https://openalex.org/W41007281","https://openalex.org/W177980195","https://openalex.org/W623593394","https://openalex.org/W646631026","https://openalex.org/W1484113995","https://openalex.org/W1487199072","https://openalex.org/W1491937294","https://openalex.org/W1497421547","https://openalex.org/W1499934958","https://openalex.org/W1519485122","https://openalex.org/W1531874022","https://openalex.org/W1533361503","https://openalex.org/W1551707370","https://openalex.org/W1569427085","https://openalex.org/W1579183220","https://openalex.org/W1601373402","https://openalex.org/W1605071730","https://openalex.org/W1734364899","https://openalex.org/W1850900101","https://openalex.org/W1879271770","https://openalex.org/W1935088456","https://openalex.org/W1974090207","https://openalex.org/W1976268573","https://openalex.org/W1996582785","https://openalex.org/W2012095234","https://openalex.org/W2012948837","https://openalex.org/W2020577539","https://openalex.org/W2030875267","https://openalex.org/W2034188142","https://openalex.org/W2037507558","https://openalex.org/W2052170634","https://openalex.org/W2078717493","https://openalex.org/W2083770991","https://openalex.org/W2098981343","https://openalex.org/W2099863033","https://openalex.org/W2100781580","https://openalex.org/W2101170002","https://openalex.org/W2102097307","https://openalex.org/W2103718058","https://openalex.org/W2118954772","https://openalex.org/W2129384397","https://openalex.org/W2131064513","https://openalex.org/W2133712643","https://openalex.org/W2135795876","https://openalex.org/W2136920408","https://openalex.org/W2137865376","https://openalex.org/W2140700734","https://openalex.org/W2141670510","https://openalex.org/W2152206644","https://openalex.org/W2153717963","https://openalex.org/W2157144873","https://openalex.org/W2163123880","https://openalex.org/W2163369706","https://openalex.org/W2163953765","https://openalex.org/W2168359464","https://openalex.org/W2205337852","https://openalex.org/W2334782222","https://openalex.org/W2790189419","https://openalex.org/W2799137445","https://openalex.org/W2913931721","https://openalex.org/W2950385149","https://openalex.org/W3000511677","https://openalex.org/W3105798384","https://openalex.org/W3144368627","https://openalex.org/W3150847806","https://openalex.org/W4212872794","https://openalex.org/W4237047697","https://openalex.org/W4242441073","https://openalex.org/W4248627364"],"related_works":["https://openalex.org/W2059384236","https://openalex.org/W2793104284","https://openalex.org/W1495199168","https://openalex.org/W2008052156","https://openalex.org/W2113177679","https://openalex.org/W1993063311","https://openalex.org/W2022360370","https://openalex.org/W2010241460","https://openalex.org/W3007855821","https://openalex.org/W2916067202"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"considers":[3],"the":[4,20,39,42,50,61,68,90,104,107,110,121],"probabilistic":[5,15,75,111,126],"may/must":[6],"testing":[7,22,85,99,122],"theory":[8],"for":[9],"processes":[10,30],"having":[11],"external,":[12],"internal,":[13],"and":[14,27,73,109],"choices.":[16],"We":[17,114],"observe":[18],"that":[19,31,41,54,79],"underlying":[21],"equivalence":[23,100],"is":[24,101],"too":[25],"strong":[26],"distinguishes":[28],"between":[29],"are":[32],"observationally":[33],"equivalent.":[34],"The":[35,97],"problem":[36],"arises":[37],"from":[38,60],"observation":[40],"classical":[43],"compose-and-schedule":[44],"approach":[45],"yields":[46],"unrealistic":[47],"overestimation":[48],"of":[49,63,65,70,120],"probabilities,":[51],"a":[52,83,94,125],"phenomenon":[53],"has":[55],"been":[56],"recently":[57],"well":[58],"studied":[59],"point":[62],"view":[64],"compositionality,":[66],"in":[67,74,93],"context":[69],"randomized":[71],"protocols":[72],"model":[76],"checking.":[77],"To":[78],"end,":[80],"we":[81],"propose":[82],"new":[84],"theory,":[86],"aiming":[87],"at":[88],"preserving":[89],"probability":[91],"information":[92],"parallel":[95],"context.":[96],"resulting":[98],"insensitive":[102],"to":[103],"exact":[105],"moment":[106],"internal":[108],"choices":[112],"occur.":[113],"also":[115],"give":[116],"an":[117],"alternative":[118],"characterization":[119],"preorder":[123],"as":[124],"ready-trace":[127],"preorder.":[128]},"counts_by_year":[{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}