{"id":"https://openalex.org/W2113443840","doi":"https://doi.org/10.1109/hpcsa.2002.1019142","title":"Graph-based algorithms for parallel processes","display_name":"Graph-based algorithms for parallel processes","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2113443840","doi":"https://doi.org/10.1109/hpcsa.2002.1019142","mag":"2113443840"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsa.2002.1019142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsa.2002.1019142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","raw_type":"proceedings-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/A5055510895","display_name":"S. Yordanova","orcid":null},"institutions":[{"id":"https://openalex.org/I168129107","display_name":"South-West University \"Neofit Rilski\"","ror":"https://ror.org/002wcjr61","country_code":"BG","type":"education","lineage":["https://openalex.org/I168129107"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"S. Yordanova","raw_affiliation_strings":["Department of Mathematics and Computer Science, Southwest University Neofit Rilski, Blagoevgrad, Bulgaria","Dept. of Math. & Comput. Sci., South-West Univ. Neofit Rilsky, Blagoevgrad, Bulgaria"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Southwest University Neofit Rilski, Blagoevgrad, Bulgaria","institution_ids":["https://openalex.org/I168129107"]},{"raw_affiliation_string":"Dept. of Math. & Comput. Sci., South-West Univ. Neofit Rilsky, Blagoevgrad, Bulgaria","institution_ids":["https://openalex.org/I168129107"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055510895"],"corresponding_institution_ids":["https://openalex.org/I168129107"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18827091,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"114","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9984999895095825,"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/computer-science","display_name":"Computer science","score":0.6545183062553406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6195182800292969},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5787630081176758},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5597518682479858},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.542772650718689},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5419811010360718},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5300402641296387},{"id":"https://openalex.org/keywords/finite-state","display_name":"Finite state","score":0.42942726612091064},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3701622486114502}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6545183062553406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6195182800292969},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5787630081176758},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5597518682479858},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.542772650718689},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5419811010360718},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5300402641296387},{"id":"https://openalex.org/C2983497884","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite state","level":3,"score":0.42942726612091064},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3701622486114502},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsa.2002.1019142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsa.2002.1019142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W258022877","https://openalex.org/W1503973138","https://openalex.org/W2160923379","https://openalex.org/W2176300081","https://openalex.org/W3144368627","https://openalex.org/W4210886820"],"related_works":["https://openalex.org/W1532285316","https://openalex.org/W4281261571","https://openalex.org/W4387024110","https://openalex.org/W2535494882","https://openalex.org/W1571505340","https://openalex.org/W2908087036","https://openalex.org/W2103029213","https://openalex.org/W4387581576","https://openalex.org/W4254987752","https://openalex.org/W2765148997"],"abstract_inverted_index":{"The":[0],"aim":[1],"of":[2,50,53],"this":[3],"paper":[4],"is":[5,24,39],"to":[6,46,58],"present":[7,43],"some":[8],"graph-based":[9],"algorithms":[10],"for":[11],"Finite":[12,21],"State":[13],"Process":[14,18],"(FSP).":[15],"Communicating":[16],"Sequential":[17],"generated":[19],"by":[20],"Transition":[22],"System":[23],"called":[25],"FSP.":[26,40],"If":[27],"P":[28],"and":[29,55],"Q":[30],"are":[31],"FSP,":[32],"the":[33],"parallel":[34,48],"process":[35,49],"P/spl":[36],"par/Q":[37],"also":[38],"We":[41],"will":[42],"an":[44,56],"algorithm":[45,57],"construct":[47,59],"finite":[51,60],"set":[52],"FSP":[54],"complete":[61],"prefix.":[62]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}