{"id":"https://openalex.org/W2101393622","doi":"https://doi.org/10.1142/s0129054113400121","title":"REACHABILITY FOR FINITE-STATE PROCESS ALGEBRAS USING HORN CLAUSES","display_name":"REACHABILITY FOR FINITE-STATE PROCESS ALGEBRAS USING HORN CLAUSES","publication_year":2013,"publication_date":"2013-02-01","ids":{"openalex":"https://openalex.org/W2101393622","doi":"https://doi.org/10.1142/s0129054113400121","mag":"2101393622"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113400121","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400121","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5036956247","display_name":"Nataliya Skrypnyuk","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"NATALIYA SKRYPNYUK","raw_affiliation_strings":["Department of Informatics and Mathematical Modelling, Technical University of Denmark, Kgs. Lyngby, 2800, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Mathematical Modelling, Technical University of Denmark, Kgs. Lyngby, 2800, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089639449","display_name":"Flemming Nielson","orcid":"https://orcid.org/0000-0001-7362-6176"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"FLEMMING NIELSON","raw_affiliation_strings":["Language-Based Technology, Department of Informatics and Mathematical Modelling, Technical University of Denmark, Kgs. Lyngby, 2800, Denmark"],"affiliations":[{"raw_affiliation_string":"Language-Based Technology, Department of Informatics and Mathematical Modelling, Technical University of Denmark, Kgs. Lyngby, 2800, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036956247"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13913923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"02","first_page":"283","last_page":"302"},"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.9973999857902527,"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.9966999888420105,"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/reachability","display_name":"Reachability","score":0.9272444248199463},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5825571417808533},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5577951669692993},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5369652509689331},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5195998549461365},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.5087390542030334},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.49079903960227966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47595784068107605},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4657260775566101},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4655061364173889},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44787320494651794},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4192134737968445},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.4132933020591736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33924975991249084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3360709846019745},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15939852595329285}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9272444248199463},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5825571417808533},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5577951669692993},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5369652509689331},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5195998549461365},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.5087390542030334},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.49079903960227966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47595784068107605},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4657260775566101},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4655061364173889},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44787320494651794},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4192134737968445},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.4132933020591736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33924975991249084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3360709846019745},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15939852595329285},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054113400121","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400121","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/2bfc075d-4251-40c5-a956-c8ec15b840db","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/2bfc075d-4251-40c5-a956-c8ec15b840db","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Skrypnyuk , N & Nielson , F 2013 , ' Reachability for Finite-state Process Algebras Using Horn Clauses ' , International Journal of Foundations of Computer Science , vol. 24 , no. 2 , pp. 283-302 . https://doi.org/10.1142/S0129054113400121","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2026788619","https://openalex.org/W4251467845"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W2101260249","https://openalex.org/W1583463005","https://openalex.org/W1604894272","https://openalex.org/W2155852086","https://openalex.org/W2149313960","https://openalex.org/W2624100179","https://openalex.org/W1860618800","https://openalex.org/W2139480393","https://openalex.org/W1551903405"],"abstract_inverted_index":{"In":[0],"this":[1],"work":[2],"we":[3],"present":[4],"an":[5,67],"algorithm":[6,84,118],"for":[7,105],"solving":[8],"the":[9,34,47,70,83,102,117,128,151,160,164],"reachability":[10,91],"problem":[11],"in":[12,28,53,101,121],"finite":[13],"systems":[14],"that":[15,120],"are":[16,51,119],"modelled":[17],"with":[18,41],"process":[19,38],"algebras.":[20],"Our":[21],"method":[22],"is":[23,95,99,111,145],"based":[24],"on":[25],"Static":[26],"Analysis,":[27,32],"particular,":[29],"Data":[30,48],"Flow":[31,49],"of":[33,36,46,59,69,116,127,159,163],"syntax":[35],"a":[37,57,88,125],"algebraic":[39],"system":[40],"multi-way":[42],"synchronisation.":[43],"The":[44,73,114],"results":[45],"Analysis":[50],"used":[52],"order":[54],"to":[55,66,137,148,156],"build":[56],"set":[58],"Horn":[60],"clauses":[61],"whose":[62,90],"least":[63,103],"model":[64,75,104],"corresponds":[65],"overapproximation":[68],"reachable":[71],"states.":[72],"computed":[74],"can":[76],"be":[77,93,133],"refined":[78],"after":[79],"each":[80],"transition,":[81],"and":[82,109,140],"runs":[85],"until":[86],"either":[87],"state":[89],"should":[92],"checked":[94],"encountered":[96,152],"or":[97],"it":[98,144],"not":[100,146],"all":[106,150],"constructed":[107],"states":[108,153],"thus":[110],"definitely":[112],"unreachable.":[113],"advantages":[115],"many":[122],"cases":[123],"only":[124],"part":[126],"Labelled":[129],"Transition":[130],"System":[131],"will":[132],"built":[134],"which":[135,154],"leads":[136,155],"lower":[138],"time":[139],"memory":[141,161],"consumption.":[142],"Also,":[143],"necessary":[147],"save":[149],"further":[157],"reduction":[158],"requirements":[162],"algorithm.":[165]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}