{"id":"https://openalex.org/W1915571054","doi":"https://doi.org/10.1007/978-3-642-41036-9_16","title":"Branching-Time Model Checking Gap-Order Constraint Systems","display_name":"Branching-Time Model Checking Gap-Order Constraint Systems","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1915571054","doi":"https://doi.org/10.1007/978-3-642-41036-9_16","mag":"1915571054"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-41036-9_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-41036-9_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/60ff8ba4-e9d2-423b-9fa6-905cf937b862","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"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"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/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":false,"raw_author_name":"Patrick Totzke","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"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":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.1744462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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.9990000128746033,"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/T11567","display_name":"semigroups and automata theory","score":0.9972000122070312,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9803000092506409,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7946125864982605},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7886784076690674},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7813305854797363},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5230485200881958},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5060915350914001},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5030438303947449},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4971483051776886},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4914644956588745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45022812485694885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37375038862228394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24241751432418823},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08221518993377686}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7946125864982605},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7886784076690674},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7813305854797363},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5230485200881958},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5060915350914001},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5030438303947449},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4971483051776886},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4914644956588745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45022812485694885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37375038862228394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24241751432418823},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08221518993377686}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-41036-9_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-41036-9_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/60ff8ba4-e9d2-423b-9fa6-905cf937b862","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/60ff8ba4-e9d2-423b-9fa6-905cf937b862","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mayr, R & Totzke, P 2013, Branching-Time Model Checking Gap-Order Constraint Systems. in Reachability Problems : 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings. pp. 171-182. https://doi.org/10.1007/978-3-642-41036-9_16","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/60ff8ba4-e9d2-423b-9fa6-905cf937b862","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/branchingtime-model-checking-gaporder-constraint-systems(60ff8ba4-e9d2-423b-9fa6-905cf937b862).html","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"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/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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/60ff8ba4-e9d2-423b-9fa6-905cf937b862","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/60ff8ba4-e9d2-423b-9fa6-905cf937b862","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mayr, R & Totzke, P 2013, Branching-Time Model Checking Gap-Order Constraint Systems. in Reachability Problems : 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings. pp. 171-182. https://doi.org/10.1007/978-3-642-41036-9_16","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W74242707","https://openalex.org/W205697980","https://openalex.org/W1547562281","https://openalex.org/W1872877151","https://openalex.org/W1912609664","https://openalex.org/W1977601940","https://openalex.org/W2012140001","https://openalex.org/W2019145653","https://openalex.org/W2022530540","https://openalex.org/W2067785662","https://openalex.org/W2099040330","https://openalex.org/W2105942091","https://openalex.org/W2129883154","https://openalex.org/W2136485937","https://openalex.org/W2146250272","https://openalex.org/W2164003033","https://openalex.org/W2205337852"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W2170336571","https://openalex.org/W2618109676"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}