{"id":"https://openalex.org/W1759329707","doi":"https://doi.org/10.3233/fi-1998-3611","title":"Adding Partial Orders to Linear Temporal Logic","display_name":"Adding Partial Orders to Linear Temporal Logic","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1759329707","doi":"https://doi.org/10.3233/fi-1998-3611","mag":"1759329707"},"language":"en","primary_location":{"id":"doi:10.3233/fi-1998-3611","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-1998-3611","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5086292237","display_name":"Girish Bhat","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Girish Bhat","raw_affiliation_strings":["Make Systems, 4000 Regency Parkway, Cary, NC 27511-8502. email: girish@makesys.com","(Correspd.) (This paper was written while at the Department of Computer Science, North Carolina State University, Raleigh, NC 27606, USA, and during a visit to Bell Laboratories) Make Systems, 400 "],"affiliations":[{"raw_affiliation_string":"Make Systems, 4000 Regency Parkway, Cary, NC 27511-8502. email: girish@makesys.com","institution_ids":[]},{"raw_affiliation_string":"(Correspd.) (This paper was written while at the Department of Computer Science, North Carolina State University, Raleigh, NC 27606, USA, and during a visit to Bell Laboratories) Make Systems, 400 ","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061223044","display_name":"Doron Peled","orcid":"https://orcid.org/0000-0002-7280-6578"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Doron Peled","raw_affiliation_strings":["Bell Laboratories, 700 Mountain Ave., Murray Hill, NJ, 07974, USA. email: doron@research.bell-labs.com","(Correspd.) Bell Laboratories, 700 Mountain Ave., Murray Hill, NJ, 07974, USA. email: doron@research.bell-labs.com"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, 700 Mountain Ave., Murray Hill, NJ, 07974, USA. email: doron@research.bell-labs.com","institution_ids":[]},{"raw_affiliation_string":"(Correspd.) Bell Laboratories, 700 Mountain Ave., Murray Hill, NJ, 07974, USA. email: doron@research.bell-labs.com","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086292237"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5112,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71552503,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"36","issue":"1","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9983999729156494,"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/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5622063279151917},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.45654797554016113},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44292449951171875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42321544885635376},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33318978548049927},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2619944214820862}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5622063279151917},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.45654797554016113},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44292449951171875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42321544885635376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33318978548049927},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2619944214820862}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-1998-3611","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-1998-3611","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1490966766","https://openalex.org/W1571449242","https://openalex.org/W1767070588","https://openalex.org/W1895483727","https://openalex.org/W1937990781","https://openalex.org/W1980003032","https://openalex.org/W1990161286","https://openalex.org/W2031145943","https://openalex.org/W2034410903","https://openalex.org/W2058101359","https://openalex.org/W2065353132","https://openalex.org/W2066210260","https://openalex.org/W2087411240","https://openalex.org/W2131053137","https://openalex.org/W2137307988","https://openalex.org/W2150320481","https://openalex.org/W2167557276","https://openalex.org/W2293328166","https://openalex.org/W2809037521","https://openalex.org/W2913202392"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2124110813","https://openalex.org/W2521108391","https://openalex.org/W1532447905","https://openalex.org/W2031188261","https://openalex.org/W2763487042","https://openalex.org/W3021103820","https://openalex.org/W4285022830","https://openalex.org/W4232446061","https://openalex.org/W2077520193"],"abstract_inverted_index":{"Modeling":[0],"execution":[1,20,42,54,98],"as":[2,38,99],"partial":[3,71,89],"orders":[4],"increases":[5],"the":[6,15,53,62,67,138],"flexibility":[7],"in":[8,27],"reasoning":[9],"about":[10],"concurrent":[11,29],"programs":[12],"by":[13],"allowing":[14],"use":[16],"of":[17,64,70,103],"alternative,":[18],"equivalent":[19,41],"sequences.":[21],"This":[22],"is":[23,74,93,109,126],"a":[24,46,81,100,130],"desirable":[25],"feature":[26],"specifying":[28],"systems":[30],"which":[31,84],"allows":[32,85],"formalizing":[33],"frequently":[34],"used":[35],"arguments":[36],"such":[37],"\u2018in":[39,45],"an":[40,97,148],"sequence\u2019,":[43],"or":[44],"consistent":[47],"global":[48,104],"state,":[49],"not":[50],"necessarily":[51],"on":[52,95],"sequence\u2019":[55],"to":[56,61,66],"be":[57],"formalized.":[58],"However,":[59],"due":[60],"addition":[63],"structure":[65],"model,":[68],"verification":[69],"order":[72,90],"properties":[73],"non-trivial":[75],"and":[76,87,132],"sparse.":[77],"We":[78,128],"present":[79],"here":[80],"new":[82],"approach":[83],"expressing":[86],"verifying":[88],"properties.":[91],"It":[92],"based":[94],"modeling":[96],"linear":[101],"sequence":[102],"states,":[105],"where":[106],"each":[107],"state":[108],"equipped":[110],"with":[111],"its":[112],"past":[113],"partial-order":[114],"history.":[115],"The":[116],"temporal":[117],"logic":[118,139],"BPLTL":[119,140],"(for":[120],"Branching":[121],"Past":[122],"Linear":[123],"Temporal":[124],"Logic)":[125],"introduced.":[127],"provide":[129],"sound":[131],"relatively":[133],"complete":[134],"proof":[135,145,150],"system":[136,146,151],"for":[137,152],"over":[141],"transitions":[142],"programs.":[143],"Our":[144],"augments":[147],"existing":[149],"LTL.":[153]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}