{"id":"https://openalex.org/W2963502804","doi":"https://doi.org/10.3233/fi-2016-1317","title":"Branching-Time Model Checking Gap-Order Constraint Systems","display_name":"Branching-Time Model Checking Gap-Order Constraint Systems","publication_year":2016,"publication_date":"2016-03-04","ids":{"openalex":"https://openalex.org/W2963502804","doi":"https://doi.org/10.3233/fi-2016-1317","mag":"2963502804"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2016-1317","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1317","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/c6591924-6942-4c26-adc4-4dd29923dda1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Richard Mayr","raw_affiliation_strings":["University of Edinburgh, UK","School of Informatics"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060577776","display_name":"Patrick Totzke","orcid":"https://orcid.org/0000-0001-5274-8190"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Patrick Totzke","raw_affiliation_strings":["University of Warwick, UK","School of Informatics"],"affiliations":[{"raw_affiliation_string":"University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082358544"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24487219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"143","issue":"3-4","first_page":"339","last_page":"353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9965000152587891,"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.9965000152587891,"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9681000113487244,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"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.9624999761581421,"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/undecidable-problem","display_name":"Undecidable problem","score":0.8003082275390625},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7859723567962646},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7751973867416382},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5404729247093201},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.518622100353241},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.505912721157074},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49877500534057617},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4786323606967926},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.44899600744247437},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41181617975234985},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3788919150829315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2466449737548828},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16429856419563293}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8003082275390625},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7859723567962646},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7751973867416382},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5404729247093201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.518622100353241},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.505912721157074},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49877500534057617},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4786323606967926},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.44899600744247437},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41181617975234985},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3788919150829315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2466449737548828},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16429856419563293},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3233/fi-2016-1317","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1317","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/c6591924-6942-4c26-adc4-4dd29923dda1","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/c6591924-6942-4c26-adc4-4dd29923dda1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mayr, R & Totzke, P 2015, 'Branching-Time Model Checking Gap-Order Constraint Systems', Fundamenta Informaticae, vol. 143, no. 3-4, pp. 339-353. https://doi.org/10.3233/FI-2016-1317","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:2963502804","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1307.4207","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1032.9857","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1032.9857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.inf.ed.ac.uk/rmayr/RP2013.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.744.4138","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.744.4138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1307.4207.pdf","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/c6591924-6942-4c26-adc4-4dd29923dda1","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/c6591924-6942-4c26-adc4-4dd29923dda1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mayr, R & Totzke, P 2015, 'Branching-Time Model Checking Gap-Order Constraint Systems', Fundamenta Informaticae, vol. 143, no. 3-4, pp. 339-353. https://doi.org/10.3233/FI-2016-1317","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/c6591924-6942-4c26-adc4-4dd29923dda1","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/c6591924-6942-4c26-adc4-4dd29923dda1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mayr, R & Totzke, P 2015, 'Branching-Time Model Checking Gap-Order Constraint Systems', Fundamenta Informaticae, vol. 143, no. 3-4, pp. 339-353. https://doi.org/10.3233/FI-2016-1317","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8632426069","display_name":null,"funder_award_id":"EP/M027651/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1758564903","https://openalex.org/W1737156267","https://openalex.org/W1869685613","https://openalex.org/W1859059663","https://openalex.org/W2019146106","https://openalex.org/W1751131962","https://openalex.org/W3082792656","https://openalex.org/W2016206563","https://openalex.org/W1506755467","https://openalex.org/W2240751524","https://openalex.org/W153129168","https://openalex.org/W3206503250","https://openalex.org/W2898732469","https://openalex.org/W2165040865","https://openalex.org/W3196874774","https://openalex.org/W1986204772","https://openalex.org/W2290694653","https://openalex.org/W2984549757","https://openalex.org/W2083449758","https://openalex.org/W3143710704"],"abstract_inverted_index":{"We":[0,66],"consider":[1],"the":[2,12,43,84],"model":[3,70],"checking":[4,71],"problem":[5],"for":[6,74],"Gap-order":[7],"Constraint":[8],"Systems":[9],"(GCS)":[10],"w.r.t.":[11],"branching-time":[13],"temporal":[14],"logic":[15],"CTL,":[16],"and":[17,23,52,58,88,94],"in":[18],"particular":[19],"its":[20],"fragments":[21],"EG":[22,69],"EF.":[24],"GCS":[25,93],"are":[26,54],"nondeterministic":[27],"infinitely":[28],"branching":[29],"processes":[30],"described":[31],"by":[32],"evolutions":[33],"of":[34,42,86],"integer-valued":[35],"variables,":[36],"subject":[37],"to":[38],"Presburger":[39],"c":[40],"onstraints":[41],"form":[44],"x":[45,51],"\u2212":[46],"y":[47,53],"\u2265":[48],"k,":[49],"where":[50],"variables":[55],"or":[56],"constants":[57],"k":[59],"\u2208":[60],"\u2115":[61],"is":[62,72,78],"a":[63],"non-negative":[64],"constant.":[65],"show":[67],"that":[68],"undecidable":[73],"GCS,":[75],"while":[76],"EF":[77],"decidable.":[79],"In":[80],"particular,":[81],"this":[82],"implies":[83],"decidability":[85],"strong":[87],"weak":[89],"bisimulation":[90],"equivalence":[91],"between":[92],"finite-state":[95],"systems.":[96]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}