{"id":"https://openalex.org/W4409254903","doi":"https://doi.org/10.46298/lmcs-21(2:2)2025","title":"Safety and Liveness of Quantitative Properties and Automata","display_name":"Safety and Liveness of Quantitative Properties and Automata","publication_year":2025,"publication_date":"2025-04-08","ids":{"openalex":"https://openalex.org/W4409254903","doi":"https://doi.org/10.46298/lmcs-21(2:2)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(2:2)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:2)2025","pdf_url":"https://lmcs.episciences.org/15478/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/15478/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000415323","display_name":"Udi Boker","orcid":"https://orcid.org/0000-0003-4322-8892"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Udi Boker","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080555605","display_name":"Thomas A. Henzinger","orcid":"https://orcid.org/0000-0002-2985-7724"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas A. Henzinger","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081762569","display_name":"Nicolas Mazzocchi","orcid":"https://orcid.org/0000-0001-6425-5369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicolas Mazzocchi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5016689777","display_name":"N. Ege Sara\u00e7","orcid":"https://orcid.org/0009-0000-2866-8078"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Ege Sara\u00e7","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000415323"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.669,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83218657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"Volume 21, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9136999845504761,"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.9136999845504761,"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.9071000218391418,"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/liveness","display_name":"Liveness","score":0.9722042083740234},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7026599645614624},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6728638410568237},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4220495820045471},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3445429503917694}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.9722042083740234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7026599645614624},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6728638410568237},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4220495820045471},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3445429503917694}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(2:2)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:2)2025","pdf_url":"https://lmcs.episciences.org/15478/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:be4ad5ec73da419b976036fdfceea5d5","is_oa":true,"landing_page_url":"https://doaj.org/article/be4ad5ec73da419b976036fdfceea5d5","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 2 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(2:2)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:2)2025","pdf_url":"https://lmcs.episciences.org/15478/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320315473","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409254903.pdf","grobid_xml":"https://content.openalex.org/works/W4409254903.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1565271071","https://openalex.org/W2081199208","https://openalex.org/W2053262709","https://openalex.org/W3160870209","https://openalex.org/W3349016","https://openalex.org/W4300867686","https://openalex.org/W2124122503"],"abstract_inverted_index":{"Safety":[0],"and":[1,80,87,95,97,111,130,138,149,152,159,189,193,204,243,250],"liveness":[2,131,160],"stand":[3],"as":[4],"fundamental":[5],"concepts":[6],"in":[7,14,161],"formal":[8],"languages,":[9],"playing":[10],"a":[11,24,32,144,223,228,246],"key":[12],"role":[13],"verification.":[15],"The":[16],"safety-liveness":[17,113],"classification":[18],"of":[19,35,84,106,115,156,163,176,213],"boolean":[20,116,121,165],"properties":[21,50,68,124,178],"characterizes":[22],"whether":[23,227],"given":[25,229],"property":[26],"can":[27,125],"be":[28,126],"falsified":[29],"by":[30,180],"observing":[31],"finite":[33],"prefix":[34],"an":[36],"infinite":[37,55,73,207],"computation":[38],"trace":[39],"(always":[40],"for":[41,44,225],"safety,":[42],"never":[43],"liveness).":[45],"In":[46],"the":[47,64,82,108,112,173,210],"quantitative":[48,65,85,93,104,123,147,157,177,183],"setting,":[49],"are":[51,69],"arbitrary":[52,70],"functions":[53,71,197],"from":[54],"words":[56,74,208],"to":[57,63,75,238],"partially-ordered":[58,76],"domains.":[59],"Extending":[60],"this":[61],"paradigm":[62],"domain,":[66],"where":[67],"mapping":[72],"domains,":[77],"we":[78,90,168,221,235,244],"introduce":[79],"study":[81],"notions":[83],"safety":[86,94,129,148,158,241],"liveness.":[88],"First,":[89],"formally":[91],"define":[92],"liveness,":[96],"prove":[98],"that":[99],"our":[100,170],"definitions":[101],"induce":[102],"conservative":[103],"generalizations":[105],"both":[107],"safety-progress":[109],"hierarchy":[110],"decomposition":[114],"properties.":[117],"Consequently,":[118],"like":[119],"their":[120,164,194],"counterparts,":[122],"min-decomposed":[127],"into":[128,136,209,248],"parts,":[132],"or":[133,233],"alternatively,":[134],"max-decomposed":[135],"co-safety":[137],"co-liveness":[139],"parts.":[140],"We":[141],"further":[142],"establish":[143],"connection":[145],"between":[146],"topological":[150],"continuity":[151],"provide":[153,222],"alternative":[154],"characterizations":[155],"terms":[162],"analogs.":[166],"Second,":[167],"instantiate":[169],"framework":[171],"with":[172],"specific":[174],"classes":[175],"expressed":[179],"automata.":[181,252],"These":[182],"automata":[184],"contain":[185],"finitely":[186],"many":[187],"states":[188],"rational-valued":[190],"transition":[191],"weights,":[192],"common":[195,218],"value":[196,219],"Inf,":[198],"Sup,":[199],"LimInf,":[200],"LimSup,":[201],"LimInfAvg,":[202],"LimSupAvg,":[203],"DSum":[205],"map":[206],"totally-ordered":[211],"domain":[212],"real":[214],"numbers.":[215],"For":[216],"all":[217],"functions,":[220],"procedure":[224],"deciding":[226],"automaton":[230],"is":[231],"safe":[232,249],"live,":[234],"show":[236],"how":[237],"construct":[239],"its":[240],"closure,":[242],"present":[245],"min-decomposition":[247],"live":[251]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}