{"id":"https://openalex.org/W2041203617","doi":"https://doi.org/10.1016/s0304-3975(00)00101-8","title":"Decidability of model checking with the temporal logic EF","display_name":"Decidability of model checking with the temporal logic EF","publication_year":2001,"publication_date":"2001-04-01","ids":{"openalex":"https://openalex.org/W2041203617","doi":"https://doi.org/10.1016/s0304-3975(00)00101-8","mag":"2041203617"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(00)00101-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(00)00101-8","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Richard Mayr","raw_affiliation_strings":["Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Arcisstr. 21, D-80290 M\u00fcnchen, Germany","Techniische Univ. M\u00fcnchen, M\u00fcnchen, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Arcisstr. 21, D-80290 M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Techniische Univ. M\u00fcnchen, M\u00fcnchen, Germany#TAB#","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082358544"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.7394,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.89753376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"256","issue":"1-2","first_page":"31","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9979000091552734,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9941999912261963,"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/decidability","display_name":"Decidability","score":0.782239556312561},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7389177083969116},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7073328495025635},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6559401750564575},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6407370567321777},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.6373744606971741},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.5652371048927307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5196132063865662},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.4448692798614502},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.4247822165489197},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.4229251742362976},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4093925952911377},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38718515634536743},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3623383641242981},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3533051013946533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35121023654937744},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.32727450132369995},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1779100000858307},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.1639062464237213},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.09125062823295593}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.782239556312561},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7389177083969116},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7073328495025635},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6559401750564575},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6407370567321777},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.6373744606971741},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.5652371048927307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5196132063865662},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.4448692798614502},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.4247822165489197},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.4229251742362976},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4093925952911377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38718515634536743},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3623383641242981},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3533051013946533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35121023654937744},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32727450132369995},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1779100000858307},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.1639062464237213},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.09125062823295593},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(00)00101-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(00)00101-8","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.541","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.ed.ac.uk/home/mayrri/ef.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W51714471","https://openalex.org/W258022877","https://openalex.org/W260642817","https://openalex.org/W1480220904","https://openalex.org/W1485002745","https://openalex.org/W1489794625","https://openalex.org/W1492575876","https://openalex.org/W1501776715","https://openalex.org/W1503973138","https://openalex.org/W1526796383","https://openalex.org/W1530940145","https://openalex.org/W1564221482","https://openalex.org/W1585439660","https://openalex.org/W1589224558","https://openalex.org/W1595979400","https://openalex.org/W1658032593","https://openalex.org/W1977601940","https://openalex.org/W1997640494","https://openalex.org/W2005312844","https://openalex.org/W2006265470","https://openalex.org/W2039461733","https://openalex.org/W2045826397","https://openalex.org/W2069246612","https://openalex.org/W2125768798","https://openalex.org/W2132295002","https://openalex.org/W2136485937","https://openalex.org/W2158942489","https://openalex.org/W2268014521","https://openalex.org/W2720631021","https://openalex.org/W2912614885","https://openalex.org/W6633559267"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W392685101","https://openalex.org/W2012479020","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W1557750304","https://openalex.org/W2350953867","https://openalex.org/W2062273688","https://openalex.org/W1594689556"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}