{"id":"https://openalex.org/W1883955460","doi":"https://doi.org/10.1007/3-540-45931-6_26","title":"Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes","display_name":"Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1883955460","doi":"https://doi.org/10.1007/3-540-45931-6_26","mag":"1883955460"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45931-6_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45931-6_26","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/files/12418102/download_7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082258374","display_name":"Ulrich Sch\u00f6pp","orcid":"https://orcid.org/0000-0002-5445-9461"},"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":"Ulrich Sch\u00f6pp","raw_affiliation_strings":["LFCS, Division of Informatics, University of Edinburgh, JCMB, King\u2019s Buildings, EH9 3JZ, Edinburgh","LFCS, Division of Informatics, University of Edinburgh, JCMB, King's Buildings, EH9 3JZ, Edinburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LFCS, Division of Informatics, University of Edinburgh, JCMB, King\u2019s Buildings, EH9 3JZ, Edinburgh","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"LFCS, Division of Informatics, University of Edinburgh, JCMB, King's Buildings, EH9 3JZ, Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110256373","display_name":"Alex Simpson","orcid":null},"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":"Alex Simpson","raw_affiliation_strings":["LFCS, Division of Informatics, University of Edinburgh, JCMB, King\u2019s Buildings, EH9 3JZ, Edinburgh","LFCS, Division of Informatics, University of Edinburgh, JCMB, King's Buildings, EH9 3JZ, Edinburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LFCS, Division of Informatics, University of Edinburgh, JCMB, King\u2019s Buildings, EH9 3JZ, Edinburgh","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"LFCS, Division of Informatics, University of Edinburgh, JCMB, King's Buildings, EH9 3JZ, Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0272,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.74013193,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"372","last_page":"386"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9965999722480774,"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/sequent-calculus","display_name":"Sequent calculus","score":0.72265625},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.719426155090332},{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.6918203234672546},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6184030771255493},{"id":"https://openalex.org/keywords/cut-elimination-theorem","display_name":"Cut-elimination theorem","score":0.5484654307365417},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5012984275817871},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.47685205936431885},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.4685187041759491},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4442330002784729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42594170570373535},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3915829360485077},{"id":"https://openalex.org/keywords/proof-calculus","display_name":"Proof calculus","score":0.34721410274505615},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.24343952536582947},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19903677701950073},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.12598490715026855},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08536037802696228}],"concepts":[{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.72265625},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.719426155090332},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.6918203234672546},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6184030771255493},{"id":"https://openalex.org/C111404639","wikidata":"https://www.wikidata.org/wiki/Q376166","display_name":"Cut-elimination theorem","level":4,"score":0.5484654307365417},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5012984275817871},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.47685205936431885},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.4685187041759491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4442330002784729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42594170570373535},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3915829360485077},{"id":"https://openalex.org/C6489637","wikidata":"https://www.wikidata.org/wiki/Q7250002","display_name":"Proof calculus","level":3,"score":0.34721410274505615},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24343952536582947},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19903677701950073},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.12598490715026855},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08536037802696228},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/3-540-45931-6_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45931-6_26","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/270a578b-0af7-41b4-9f8f-24b85dacb086","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/270a578b-0af7-41b4-9f8f-24b85dacb086","pdf_url":"https://www.research.ed.ac.uk/files/12418102/download_7.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sch\u00f6pp, U & Simpson, A 2002, Verifying temporal properties using explicit approximants: completeness for context-free processes. in Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science, vol. 2303, pp. 372-386. https://doi.org/10.1007/3-540-45931-6_26","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.5215","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.5215","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/als/Research/approximants.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.5645","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.5645","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/us/Docs/fossacs02.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.5725","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.5725","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/als/Research/approximants_fossacs.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/270a578b-0af7-41b4-9f8f-24b85dacb086","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/verifying-temporal-properties-using-explicit-approximants-completeness-for-contextfree-processes(270a578b-0af7-41b4-9f8f-24b85dacb086).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":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/270a578b-0af7-41b4-9f8f-24b85dacb086","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/270a578b-0af7-41b4-9f8f-24b85dacb086","pdf_url":"https://www.research.ed.ac.uk/files/12418102/download_7.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sch\u00f6pp, U & Simpson, A 2002, Verifying temporal properties using explicit approximants: completeness for context-free processes. in Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science, vol. 2303, pp. 372-386. https://doi.org/10.1007/3-540-45931-6_26","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1883955460.pdf","grobid_xml":"https://content.openalex.org/works/W1883955460.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1496330206","https://openalex.org/W1560595963","https://openalex.org/W1568844705","https://openalex.org/W1573078772","https://openalex.org/W1595784499","https://openalex.org/W1607820520","https://openalex.org/W1966112122","https://openalex.org/W1971416129","https://openalex.org/W1972282372","https://openalex.org/W1978469611","https://openalex.org/W1979706237","https://openalex.org/W2014496562","https://openalex.org/W2015640848","https://openalex.org/W2036996017","https://openalex.org/W2063277731","https://openalex.org/W2088846354","https://openalex.org/W2117183817","https://openalex.org/W2153863776","https://openalex.org/W2164594049","https://openalex.org/W3021371129","https://openalex.org/W3022006420","https://openalex.org/W4285719527","https://openalex.org/W6633829483","https://openalex.org/W6634350005"],"related_works":["https://openalex.org/W4295728898","https://openalex.org/W3090765541","https://openalex.org/W1562648369","https://openalex.org/W2584381231","https://openalex.org/W2513857873","https://openalex.org/W2137780954","https://openalex.org/W2056025285","https://openalex.org/W2023557900","https://openalex.org/W162254089","https://openalex.org/W4253113110"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}