{"id":"https://openalex.org/W2615379976","doi":"https://doi.org/10.3233/fi-2017-1527","title":"SMT-based Searching for <i>k</i> -quasi-optimal Runs in Weighted Timed Automata","display_name":"SMT-based Searching for <i>k</i> -quasi-optimal Runs in Weighted Timed Automata","publication_year":2017,"publication_date":"2017-05-10","ids":{"openalex":"https://openalex.org/W2615379976","doi":"https://doi.org/10.3233/fi-2017-1527","mag":"2615379976"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2017-1527","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2017-1527","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/A5040200686","display_name":"Bo\u017cena Wo\u017ana-Szcze\u015bniak","orcid":"https://orcid.org/0000-0002-1486-6572"},"institutions":[{"id":"https://openalex.org/I126406834","display_name":"Jan D\u0142ugosz University","ror":"https://ror.org/0566yhn94","country_code":"PL","type":"education","lineage":["https://openalex.org/I126406834"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Bo\u017cena Wo\u017ana-Szcze\u015bniak","raw_affiliation_strings":["IMCS, Jan D\u0142ugosz University in Cz\u0119stochowa, Al. Armii Krajowej 13/15, 42-200 Cz\u0119stochowa, Poland. {b.wozna,agnieszka.zbrzezny,a.zbrzezny}@ajd.czest.pl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMCS, Jan D\u0142ugosz University in Cz\u0119stochowa, Al. Armii Krajowej 13/15, 42-200 Cz\u0119stochowa, Poland. {b.wozna,agnieszka.zbrzezny,a.zbrzezny}@ajd.czest.pl","institution_ids":["https://openalex.org/I126406834"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037418855","display_name":"Agnieszka M. Zbrzezny","orcid":"https://orcid.org/0000-0001-9897-3561"},"institutions":[{"id":"https://openalex.org/I126406834","display_name":"Jan D\u0142ugosz University","ror":"https://ror.org/0566yhn94","country_code":"PL","type":"education","lineage":["https://openalex.org/I126406834"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Agnieszka M. Zbrzezny","raw_affiliation_strings":["IMCS, Jan D\u0142ugosz University in Cz\u0119stochowa, Al. Armii Krajowej 13/15, 42-200 Cz\u0119stochowa, Poland. {b.wozna,agnieszka.zbrzezny,a.zbrzezny}@ajd.czest.pl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMCS, Jan D\u0142ugosz University in Cz\u0119stochowa, Al. Armii Krajowej 13/15, 42-200 Cz\u0119stochowa, Poland. {b.wozna,agnieszka.zbrzezny,a.zbrzezny}@ajd.czest.pl","institution_ids":["https://openalex.org/I126406834"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037050989","display_name":"Andrzej Zbrzezny","orcid":"https://orcid.org/0000-0003-2771-9683"},"institutions":[{"id":"https://openalex.org/I126406834","display_name":"Jan D\u0142ugosz University","ror":"https://ror.org/0566yhn94","country_code":"PL","type":"education","lineage":["https://openalex.org/I126406834"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Andrzej Zbrzezny","raw_affiliation_strings":["IMCS, Jan D\u0142ugosz University in Cz\u0119stochowa, Al. Armii Krajowej 13/15, 42-200 Cz\u0119stochowa, Poland. {b.wozna,agnieszka.zbrzezny,a.zbrzezny}@ajd.czest.pl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMCS, Jan D\u0142ugosz University in Cz\u0119stochowa, Al. Armii Krajowej 13/15, 42-200 Cz\u0119stochowa, Poland. {b.wozna,agnieszka.zbrzezny,a.zbrzezny}@ajd.czest.pl","institution_ids":["https://openalex.org/I126406834"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126406834"],"apc_list":null,"apc_paid":null,"fwci":0.6874,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7157253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"152","issue":"4","first_page":"411","last_page":"433"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9894999861717224,"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/T11567","display_name":"semigroups and automata theory","score":0.9883999824523926,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7890205383300781},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7638988494873047},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6456092596054077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6438733339309692},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6020074486732483},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5116674900054932},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5021777153015137},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.500678300857544},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.47320765256881714},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.45570051670074463},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.4479769468307495},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.44351592659950256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41809749603271484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35162413120269775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33658355474472046},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.330584317445755},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31164491176605225},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2785947918891907},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10828843712806702}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7890205383300781},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7638988494873047},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6456092596054077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6438733339309692},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6020074486732483},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5116674900054932},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5021777153015137},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.500678300857544},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.47320765256881714},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.45570051670074463},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.4479769468307495},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.44351592659950256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41809749603271484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35162413120269775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33658355474472046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.330584317445755},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31164491176605225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2785947918891907},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10828843712806702}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2017-1527","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2017-1527","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1481397690","https://openalex.org/W1495026145","https://openalex.org/W1522276539","https://openalex.org/W1528441743","https://openalex.org/W1548125182","https://openalex.org/W1583191255","https://openalex.org/W1587691136","https://openalex.org/W1589082502","https://openalex.org/W1600541802","https://openalex.org/W1717955622","https://openalex.org/W1979561589","https://openalex.org/W1987234253","https://openalex.org/W2025079043","https://openalex.org/W2029795923","https://openalex.org/W2056957549","https://openalex.org/W2065323166","https://openalex.org/W2089017767","https://openalex.org/W2128510433","https://openalex.org/W2130136014","https://openalex.org/W2134659903","https://openalex.org/W2156391157","https://openalex.org/W2340735175","https://openalex.org/W2408103738","https://openalex.org/W2913459036"],"related_works":["https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W2060144422","https://openalex.org/W2011495892","https://openalex.org/W4389158950"],"abstract_inverted_index":{"We":[0,11,113],"investigate":[1],"a":[2,13,33,49,92],"quasi-optimal":[3],"cost":[4,57,76],"reachability":[5],"problem":[6,21,123],"for":[7,67],"weighted":[8,128,135],"timed":[9,129],"automata.":[10],"use":[12,116],"translation":[14],"to":[15,22,31,59,91,102,120],"the":[16,24,43,52,60,75,88,95,115,121,127,134],"satisfiability":[17],"modulo":[18],"theories":[19],"(SMT)":[20],"solve":[23],"problem.":[25],"In":[26],"particular,":[27],"we":[28,141],"show":[29],"how":[30],"find":[32],"run":[34,80,107],"of":[35,77,81,106,117,126],"length":[36,82],"k":[37],"\u2208":[38,72],"IN":[39],"that":[40],"starts":[41],"at":[42,48],"initial":[44,89],"state":[45,50,90,93],"and":[46,74,133,140],"terminates":[47],"containing":[51,94],"target":[53,96],"location,":[54,97],"its":[55],"total":[56],"belongs":[58],"interval":[61],"[":[62],"c;":[63],"c":[64,71],"+":[65],"1),":[66],"some":[68,143],"natural":[69],"number":[70],"IN,":[73],"each":[78],"other":[79],"k,":[83],"which":[84],"also":[85],"leads":[86],"from":[87],"is":[98,108],"greater":[99],"or":[100],"equal":[101],"c.":[103],"This":[104],"kind":[105],"called":[109],"k-":[110],"quasi-":[111],"optimal.":[112],"exemplify":[114],"our":[118],"solution":[119],"investigated":[122],"by":[124],"means":[125],"generic":[130],"pipeline":[131],"protocol":[132],"job":[136],"shop":[137],"scheduling":[138],"problem,":[139],"provide":[142],"preliminary":[144],"experimental":[145],"results.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2017-05-26T00:00:00"}