{"id":"https://openalex.org/W2050304663","doi":"https://doi.org/10.1016/s0304-3975(00)00105-5","title":"Ensuring completeness of symbolic verification methods for infinite-state systems","display_name":"Ensuring completeness of symbolic verification methods for infinite-state systems","publication_year":2001,"publication_date":"2001-04-01","ids":{"openalex":"https://openalex.org/W2050304663","doi":"https://doi.org/10.1016/s0304-3975(00)00105-5","mag":"2050304663"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(00)00105-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(00)00105-5","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/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["Department Computer Systems, Uppsala University, P.O.Box 325, 751 05 Uppsala, Sweden","Uppsala University , Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Department Computer Systems, Uppsala University, P.O.Box 325, 751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Uppsala University , Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009514870","display_name":"Bengt J\u00f6nsson","orcid":"https://orcid.org/0000-0001-7897-601X"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt Jonsson","raw_affiliation_strings":["Department Computer Systems, Uppsala University, P.O.Box 325, 751 05 Uppsala, Sweden","Uppsala University , Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Department Computer Systems, Uppsala University, P.O.Box 325, 751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Uppsala University , Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002478680"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":9.1314,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.98370523,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"256","issue":"1-2","first_page":"145","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/reachability","display_name":"Reachability","score":0.9371932744979858},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.732871413230896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6643955111503601},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6507594585418701},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.6020156741142273},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5869698524475098},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5836717486381531},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5608667135238647},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.480129212141037},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.45583510398864746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45412012934684753},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4529437720775604},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4483168125152588},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4451078772544861},{"id":"https://openalex.org/keywords/hybrid-system","display_name":"Hybrid system","score":0.414331316947937},{"id":"https://openalex.org/keywords/hybrid-automaton","display_name":"Hybrid automaton","score":0.4102388918399811},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27671268582344055},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14704656600952148}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9371932744979858},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.732871413230896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6643955111503601},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6507594585418701},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.6020156741142273},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5869698524475098},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5836717486381531},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5608667135238647},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.480129212141037},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.45583510398864746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45412012934684753},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4529437720775604},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4483168125152588},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4451078772544861},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.414331316947937},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.4102388918399811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27671268582344055},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14704656600952148},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(00)00105-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(00)00105-5","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.4606","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.4606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.docs.uu.se/~bengt/Papers/Postscripts/overview.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W22002794","https://openalex.org/W326353637","https://openalex.org/W1481604828","https://openalex.org/W1515514400","https://openalex.org/W1523442991","https://openalex.org/W1529624861","https://openalex.org/W1582650717","https://openalex.org/W1857327297","https://openalex.org/W1926085771","https://openalex.org/W1964087553","https://openalex.org/W1965309410","https://openalex.org/W1965726041","https://openalex.org/W1968552123","https://openalex.org/W1980330971","https://openalex.org/W1986184086","https://openalex.org/W1997387389","https://openalex.org/W2005952505","https://openalex.org/W2012001501","https://openalex.org/W2017872109","https://openalex.org/W2019881090","https://openalex.org/W2036526834","https://openalex.org/W2061438988","https://openalex.org/W2076508310","https://openalex.org/W2080267935","https://openalex.org/W2097026217","https://openalex.org/W2118539487","https://openalex.org/W2123160677","https://openalex.org/W2123910665","https://openalex.org/W2144362636","https://openalex.org/W2146250272","https://openalex.org/W2153439859","https://openalex.org/W2316437449","https://openalex.org/W2339741178","https://openalex.org/W4244180300","https://openalex.org/W4247648311","https://openalex.org/W6600917210","https://openalex.org/W6628560403","https://openalex.org/W6631137266","https://openalex.org/W6634903634","https://openalex.org/W6642486617","https://openalex.org/W6681287053"],"related_works":["https://openalex.org/W1938126780","https://openalex.org/W1525967073","https://openalex.org/W2115802893","https://openalex.org/W1494167205","https://openalex.org/W2795943051","https://openalex.org/W2153269726","https://openalex.org/W2803699674","https://openalex.org/W2107012191","https://openalex.org/W2050304663","https://openalex.org/W1518566078"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}