{"id":"https://openalex.org/W2102661759","doi":"https://doi.org/10.1109/time.2004.1314430","title":"On-the-fly automata construction for dynamic linear time temporal logic","display_name":"On-the-fly automata construction for dynamic linear time temporal logic","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2102661759","doi":"https://doi.org/10.1109/time.2004.1314430","mag":"2102661759"},"language":"en","primary_location":{"id":"doi:10.1109/time.2004.1314430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2004.1314430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.","raw_type":"proceedings-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/A5002078119","display_name":"Laura Giordano","orcid":"https://orcid.org/0000-0001-9445-7770"},"institutions":[{"id":"https://openalex.org/I123338534","display_name":"Universit\u00e0 degli Studi del Piemonte Orientale \u201cAmedeo Avogadro\u201d","ror":"https://ror.org/04387x656","country_code":"IT","type":"education","lineage":["https://openalex.org/I123338534"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"L. Giordano","raw_affiliation_strings":["Universita del Piemonte Orientale, Alessandria, Italy","Univ. del Piemonte Orientale, Alessandria, Italy"],"affiliations":[{"raw_affiliation_string":"Universita del Piemonte Orientale, Alessandria, Italy","institution_ids":["https://openalex.org/I123338534"]},{"raw_affiliation_string":"Univ. del Piemonte Orientale, Alessandria, Italy","institution_ids":["https://openalex.org/I123338534"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109191630","display_name":"Alberto Martelli","orcid":null},"institutions":[{"id":"https://openalex.org/I55143463","display_name":"University of Turin","ror":"https://ror.org/048tbm396","country_code":"IT","type":"education","lineage":["https://openalex.org/I55143463"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Martelli","raw_affiliation_strings":["Universita di Torino, Torino, Italy","Universit\u00e0 di Torino"],"affiliations":[{"raw_affiliation_string":"Universita di Torino, Torino, Italy","institution_ids":["https://openalex.org/I55143463"]},{"raw_affiliation_string":"Universit\u00e0 di Torino","institution_ids":["https://openalex.org/I55143463"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002078119"],"corresponding_institution_ids":["https://openalex.org/I123338534"],"apc_list":null,"apc_paid":null,"fwci":1.7271,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8460544,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"139"},"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.9990000128746033,"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.9421954154968262},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.8053198456764221},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.6894755363464355},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.6519025564193726},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.636795699596405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5739670991897583},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5490208864212036},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5399830341339111},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.539227306842804},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.502094030380249},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.4851025342941284},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.47277358174324036},{"id":"https://openalex.org/keywords/on-the-fly","display_name":"On the fly","score":0.4710509777069092},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46568217873573303},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45158088207244873},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35230493545532227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35057705640792847},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.26597264409065247},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.23179727792739868},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.2145814597606659}],"concepts":[{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.9421954154968262},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.8053198456764221},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.6894755363464355},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.6519025564193726},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.636795699596405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5739670991897583},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5490208864212036},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5399830341339111},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.539227306842804},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.502094030380249},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.4851025342941284},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.47277358174324036},{"id":"https://openalex.org/C2781020372","wikidata":"https://www.wikidata.org/wiki/Q533093","display_name":"On the fly","level":2,"score":0.4710509777069092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46568217873573303},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45158088207244873},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35230493545532227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35057705640792847},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.26597264409065247},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.23179727792739868},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2145814597606659},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/time.2004.1314430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2004.1314430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.104.4001","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.4001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mfn.unipmn.it/~laura/papers/TIME04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W170090311","https://openalex.org/W1485520530","https://openalex.org/W1507116188","https://openalex.org/W1516806823","https://openalex.org/W1583357444","https://openalex.org/W1607782211","https://openalex.org/W1884045513","https://openalex.org/W1990609140","https://openalex.org/W2143050727","https://openalex.org/W2145394419","https://openalex.org/W2806619258","https://openalex.org/W6630996812","https://openalex.org/W6634769303","https://openalex.org/W6636258220"],"related_works":["https://openalex.org/W2026879508","https://openalex.org/W63685668","https://openalex.org/W2155870982","https://openalex.org/W1482505495","https://openalex.org/W2102661759","https://openalex.org/W4231063068","https://openalex.org/W2042728676","https://openalex.org/W2321527407","https://openalex.org/W3135656023","https://openalex.org/W56377157"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,7,11,20,50,67,72],"tableau-based":[3],"algorithm":[4],"for":[5,47,83],"obtaining":[6],"Buchi":[8,68],"automaton":[9,40,65,69],"from":[10],"formula":[12],"in":[13],"dynamic":[14],"linear":[15],"time":[16],"temporal":[17],"logic":[18,21],"(DLTL),":[19],"which":[22],"extends":[23],"LTL":[24],"by":[25],"indexing":[26],"the":[27,36,39,44,58,84,87],"until":[28,61],"operator":[29],"with":[30],"regular":[31],"programs.":[32],"The":[33,63,75],"construction":[34,46,76],"of":[35,38,60,86],"states":[37],"is":[41,66],"similar":[42],"to":[43,56],"standard":[45],"LTL,":[48],"but":[49],"different":[51],"technique":[52],"must":[53],"be":[54,78],"used":[55],"verify":[57],"fulfillment":[59],"formulas.":[62],"resulting":[64],"rather":[70],"than":[71],"generalized":[73],"one.":[74],"can":[77],"done":[79],"on-the-fly,":[80],"while":[81],"checking":[82],"emptiness":[85],"automaton.":[88]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
