{"id":"https://openalex.org/W2073540007","doi":"https://doi.org/10.1007/s00165-007-0048-1","title":"A unification of probabilistic choice within a design-based model of reversible computation","display_name":"A unification of probabilistic choice within a design-based model of reversible computation","publication_year":2007,"publication_date":"2007-11-12","ids":{"openalex":"https://openalex.org/W2073540007","doi":"https://doi.org/10.1007/s00165-007-0048-1","mag":"2073540007"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-007-0048-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-007-0048-1","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-007-0048-1","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":null,"license_id":null,"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":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-007-0048-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015296279","display_name":"Bill Stoddart","orcid":null},"institutions":[{"id":"https://openalex.org/I874055015","display_name":"Teesside University","ror":"https://ror.org/03z28gk75","country_code":"GB","type":"education","lineage":["https://openalex.org/I874055015"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Bill Stoddart","raw_affiliation_strings":["School of Computing, University of Teesside, Borough Road, TSI 3BA, Middlesbrough, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Teesside, Borough Road, TSI 3BA, Middlesbrough, UK","institution_ids":["https://openalex.org/I874055015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082109015","display_name":"Frank Zeyda","orcid":"https://orcid.org/0009-0009-4251-4740"},"institutions":[{"id":"https://openalex.org/I52099693","display_name":"University of York","ror":"https://ror.org/04m01e293","country_code":"GB","type":"education","lineage":["https://openalex.org/I52099693"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Frank Zeyda","raw_affiliation_strings":["High Integrity Systems Engineering Group, Department of Computer Science, University of York, York, UK"],"affiliations":[{"raw_affiliation_string":"High Integrity Systems Engineering Group, Department of Computer Science, University of York, York, UK","institution_ids":["https://openalex.org/I52099693"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015296279"],"corresponding_institution_ids":["https://openalex.org/I874055015"],"apc_list":null,"apc_paid":null,"fwci":1.408,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85235243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"25","issue":"1","first_page":"107","last_page":"131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9994000196456909,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9994000196456909,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.998199999332428,"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/T10622","display_name":"Quantum Mechanics and Applications","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.8275146484375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6951192021369934},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5875588059425354},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5605865120887756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.503750741481781},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4539300501346588},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.44862914085388184},{"id":"https://openalex.org/keywords/probabilistic-argumentation","display_name":"Probabilistic argumentation","score":0.43354135751724243},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28473758697509766},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15604272484779358}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8275146484375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6951192021369934},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5875588059425354},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5605865120887756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.503750741481781},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4539300501346588},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.44862914085388184},{"id":"https://openalex.org/C128828806","wikidata":"https://www.wikidata.org/wiki/Q7246848","display_name":"Probabilistic argumentation","level":3,"score":0.43354135751724243},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28473758697509766},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15604272484779358},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00165-007-0048-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-007-0048-1","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-007-0048-1","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:openaire/d3e25002-173f-4330-b449-df83e02ee520","is_oa":false,"landing_page_url":"https://research.tees.ac.uk/en/publications/d3e25002-173f-4330-b449-df83e02ee520","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stoddart, B & Zeyda, F 2013, 'A unification of probabilistic choice within a design-based model of reversible computation', Formal Aspects of Computing, vol. 25, no. 1, pp. 107-131. https://doi.org/10.1007/s00165-007-0048-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/d3e25002-173f-4330-b449-df83e02ee520","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s00165-007-0048-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306402475","display_name":"Teesside University Research Portal (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"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:oai:tees.openrepository.com:10149/58314","is_oa":false,"landing_page_url":"http://hdl.handle.net/10149/58314","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s00165-007-0048-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-007-0048-1","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-007-0048-1","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2073540007.pdf","grobid_xml":"https://content.openalex.org/works/W2073540007.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1484023452","https://openalex.org/W1518164703","https://openalex.org/W1566461513","https://openalex.org/W1572156610","https://openalex.org/W1734364899","https://openalex.org/W1967919774","https://openalex.org/W1970904244","https://openalex.org/W2011444209","https://openalex.org/W2030865387","https://openalex.org/W2068967633","https://openalex.org/W2072033902","https://openalex.org/W2081945419","https://openalex.org/W2097701225","https://openalex.org/W2105259569","https://openalex.org/W2149158279","https://openalex.org/W2292996153","https://openalex.org/W2911821966","https://openalex.org/W2912117092","https://openalex.org/W4233798822"],"related_works":["https://openalex.org/W2995415950","https://openalex.org/W4362598739","https://openalex.org/W4378221898","https://openalex.org/W4294533825","https://openalex.org/W3206245021","https://openalex.org/W2404949192","https://openalex.org/W2225666389","https://openalex.org/W2371210594","https://openalex.org/W2808385338","https://openalex.org/W1855805902"],"abstract_inverted_index":{"Abstract":[0],"We":[1,52,110,128,154,177,203],"see":[2],"reversible":[3],"computing":[4],"as":[5,113],"a":[6,49,99,107,139,148,201,230,248],"generalisation":[7],"of":[8,16,45,115,135,150,186,200],"sequential":[9],"computation":[10],"obtained":[11],"by":[12,174,258],"revoking":[13],"the":[14,17,43,74,95,130,136,156,165,183,198,205,237,262],"law":[15],"excluded":[18],"miracle.":[19],"Our":[20,89],"execution":[21],"language":[22],"includes":[23],"naked":[24],"guarded":[25],"commands":[26,223],"and":[27,39,59,80,83,87,101,132,142,160,163,210,227,242],"non-deterministic":[28,40,81,161,192],"choice.":[29],"Choices":[30],"which":[31,97,189,221],"lead":[32],"to":[33,72,93,105,125,194,197,215,234],"miraculous":[34],"continuations":[35],"invoke":[36],"reverse":[37,225],"computation,":[38],"choice":[41,47,55,79,82,86,162,209,241],"plays":[42],"r\u00f4le":[44],"provisional":[46],"within":[48,118,182],"backtracking":[50],"context.":[51],"require":[53],"probabilistic":[54,78,85,133,152,159,208,240],"for":[56],"symmetry":[57],"breaking":[58],"sampling":[60],"large":[61],"search":[62],"spaces,":[63],"but":[64],"must":[65],"formulate":[66],"it":[67],"differently":[68],"from":[69],"previous":[70],"approaches":[71],"obtain":[73],"required":[75,214],"interactions":[76],"between":[77,84,158,207,239],"feasibility.":[88],"formulation":[90],"allows":[91,190],"us":[92],"derive":[94],"post-distributions":[96],"characterise":[98],"program,":[100],"we":[102,228],"use":[103],"these":[104],"construct":[106],"relational":[108],"model.":[109],"consider":[111,155,204],"refinement":[112],"containment":[114],"convex":[116],"closures":[117],"distribution":[119],"space,":[120],"qualified":[121],"with":[122,138],"additional":[123],"conditions":[124],"avoid":[126],"over-refinement.":[127],"link":[129],"non-probabilistic":[131],"versions":[134],"model":[137],"Galois":[140],"connection":[141],"show":[143,235],"that":[144,170,212],"classical":[145],"designs":[146],"are":[147,256],"retract":[149],"our":[151,259,270],"designs.":[153],"interaction":[157,206,238],"find":[164],"same":[166,184],"initially":[167],"counter-intuitive":[168],"results":[169],"have":[171],"been":[172],"noted":[173],"other":[175],"investigators.":[176],"provide":[178],"an":[179,217],"alternative":[180],"formulation,":[181],"model,":[185],"oblivious":[187],"non-determinism,":[188],"all":[191],"choices":[193],"be":[195,245],"moved":[196],"start":[199],"computation.":[202],"feasibility":[211,243],"is":[213],"match":[216],"operational":[218],"interpretation":[219],"in":[220,247],"infeasible":[222],"provoke":[224],"execution,":[226],"present":[229],"small":[231],"case":[232],"study":[233],"how":[236],"can":[244],"exploited":[246],"practical":[249],"program.":[250],"All":[251],"programming":[252],"structures":[253],"described":[254],"here":[255],"supported":[257],"implementation":[260],"platform,":[261],"Reversible":[263],"Virtual":[264],"Machine,":[265],"whose":[266],"development":[267],"has":[268],"accompanied":[269],"theoretical":[271],"investigations.":[272]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
