{"id":"https://openalex.org/W2119055724","doi":"https://doi.org/10.1017/s1471068403001790","title":"Bounded LTL model checking with stable models","display_name":"Bounded LTL model checking with stable models","publication_year":2003,"publication_date":"2003-07-01","ids":{"openalex":"https://openalex.org/W2119055724","doi":"https://doi.org/10.1017/s1471068403001790","mag":"2119055724"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068403001790","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068403001790","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","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/A5078732211","display_name":"Keijo Heljanko","orcid":"https://orcid.org/0000-0002-4547-2701"},"institutions":[{"id":"https://openalex.org/I2800229700","display_name":"Helsinki Institute of Physics","ror":"https://ror.org/01x2x1522","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I2800229700","https://openalex.org/I63548447","https://openalex.org/I94722563","https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"KEIJO HELJANKO","raw_affiliation_strings":["Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail:","Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail: Keijo.Heljanko@hut.fi "],"affiliations":[{"raw_affiliation_string":"Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail:","institution_ids":["https://openalex.org/I2800229700"]},{"raw_affiliation_string":"Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail: Keijo.Heljanko@hut.fi ","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000911721","display_name":"Ilkka Niemel\u00e4","orcid":null},"institutions":[{"id":"https://openalex.org/I2800229700","display_name":"Helsinki Institute of Physics","ror":"https://ror.org/01x2x1522","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I2800229700","https://openalex.org/I63548447","https://openalex.org/I94722563","https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"ILKKA NIEMEL\u00c4","raw_affiliation_strings":["Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail:","Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail: Ilkka.Niemela@hut.fi)#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail:","institution_ids":["https://openalex.org/I2800229700"]},{"raw_affiliation_string":"Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail: Ilkka.Niemela@hut.fi)#TAB#","institution_ids":["https://openalex.org/I2800229700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078732211"],"corresponding_institution_ids":["https://openalex.org/I2800229700"],"apc_list":null,"apc_paid":null,"fwci":8.8623,"has_fulltext":false,"cited_by_count":93,"citation_normalized_percentile":{"value":0.98217089,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"3","issue":"4+5","first_page":"519","last_page":"550"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9987000226974487,"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/computer-science","display_name":"Computer science","score":0.8110336065292358},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8078107833862305},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7801550030708313},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7072101831436157},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6816431283950806},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.6576417088508606},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6115142703056335},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6087448596954346},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5406413078308105},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5385794043540955},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.48484814167022705},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4701806604862213},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.44591593742370605},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.42843329906463623},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3609788119792938},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.29753196239471436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15467962622642517}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8110336065292358},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8078107833862305},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7801550030708313},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7072101831436157},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6816431283950806},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.6576417088508606},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6115142703056335},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6087448596954346},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5406413078308105},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5385794043540955},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.48484814167022705},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4701806604862213},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.44591593742370605},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.42843329906463623},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3609788119792938},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.29753196239471436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15467962622642517},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068403001790","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068403001790","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","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":27,"referenced_works":["https://openalex.org/W6279871","https://openalex.org/W51760376","https://openalex.org/W1489391022","https://openalex.org/W1503170978","https://openalex.org/W1511319905","https://openalex.org/W1511336005","https://openalex.org/W1568909857","https://openalex.org/W1576317809","https://openalex.org/W1577827016","https://openalex.org/W1595075780","https://openalex.org/W1639901403","https://openalex.org/W1672891595","https://openalex.org/W1761635979","https://openalex.org/W1787074469","https://openalex.org/W1857345107","https://openalex.org/W1875326570","https://openalex.org/W2022479543","https://openalex.org/W2061438988","https://openalex.org/W2101602798","https://openalex.org/W2107978495","https://openalex.org/W2115309705","https://openalex.org/W2141740710","https://openalex.org/W2142785340","https://openalex.org/W2152131859","https://openalex.org/W2399343913","https://openalex.org/W2913459036","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2529513861","https://openalex.org/W4361186044","https://openalex.org/W2388344305","https://openalex.org/W1571571632","https://openalex.org/W2735853128","https://openalex.org/W2283260145","https://openalex.org/W1513400763","https://openalex.org/W2019529782","https://openalex.org/W2058579816","https://openalex.org/W1583068981"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"bounded":[3,64,94,108],"model":[4,23,65,87,109],"checking":[5,66,110],"of":[6,24,29,51,78,84,93,107,111,117],"asynchronous":[7,25],"concurrent":[8],"systems":[9,26],"is":[10,38],"introduced":[11],"as":[12,100,102],"a":[13,27,41,46,58],"promising":[14],"application":[15],"area":[16],"for":[17,68],"answer":[18],"set":[19],"programming.":[20],"As":[21],"the":[22,49,52,63,69,79,85,103,118,128,131],"generalisation":[28],"communicating":[30],"automata,":[31],"1-safe":[32,42],"Petri":[33,43],"nets,":[34],"are":[35,121,134],"used.":[36],"It":[37],"shown":[39],"how":[40],"net":[44,53,70],"and":[45,96,123,130],"requirement":[47],"on":[48],"behaviour":[50],"can":[54,71],"be":[55,72],"translated":[56],"into":[57],"logic":[59],"program":[60],"such":[61],"that":[62],"problem":[67,106],"solved":[73],"by":[74],"computing":[75],"stable":[76,86],"models":[77],"corresponding":[80],"program.":[81],"The":[82],"use":[83],"semantics":[88],"leads":[89],"to":[90],"compact":[91],"encodings":[92],"reachability":[95],"deadlock":[97],"detection":[98],"tasks":[99],"well":[101],"more":[104],"general":[105],"linear":[112],"temporal":[113],"logic.":[114],"Correctness":[115],"proofs":[116],"devised":[119],"translations":[120],"given,":[122],"some":[124],"experimental":[125],"results":[126],"using":[127],"translation":[129],"Smodels":[132],"system":[133],"presented.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":11}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}