{"id":"https://openalex.org/W4414405080","doi":"https://doi.org/10.1109/icctdc64446.2025.11158756","title":"Automated Verification of BPMN Workflows Through Promela and LTL Properties","display_name":"Automated Verification of BPMN Workflows Through Promela and LTL Properties","publication_year":2025,"publication_date":"2025-07-04","ids":{"openalex":"https://openalex.org/W4414405080","doi":"https://doi.org/10.1109/icctdc64446.2025.11158756"},"language":"en","primary_location":{"id":"doi:10.1109/icctdc64446.2025.11158756","doi":"https://doi.org/10.1109/icctdc64446.2025.11158756","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icctdc64446.2025.11158756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Conference on Computing Technologies &amp;amp; Data Communication (ICCTDC)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5119695059","display_name":"Sandeep Voona","orcid":"https://orcid.org/0009-0001-3475-3794","observed_orcids":["https://orcid.org/0009-0001-3475-3794"]},"institutions":[{"id":"https://openalex.org/I4210167039","display_name":"ServiceNow (United States)","ror":"https://ror.org/05xr0bc04","country_code":"US","type":"company","lineage":["https://openalex.org/I4210167039"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sandeep Voona","raw_affiliation_strings":["ServiceNow Ltd"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ServiceNow Ltd","institution_ids":["https://openalex.org/I4210167039"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5119695059"],"corresponding_institution_ids":["https://openalex.org/I4210167039"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29493699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"01","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10703","display_name":"Business Process Modeling and Analysis","score":0.7113999724388123,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10703","display_name":"Business Process Modeling and Analysis","score":0.7113999724388123,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.2815000116825104,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.003100000089034438,"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/promela","display_name":"Promela","score":0.9150000214576721},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"linear temporal logic","score":0.8579999804496765},{"id":"https://openalex.org/keywords/model-checking","display_name":"model checking","score":0.7900000214576721},{"id":"https://openalex.org/keywords/state-transition-diagrams","display_name":"state diagrams","score":0.7900000214576721},{"id":"https://openalex.org/keywords/visitor-pattern","display_name":"visitor pattern","score":0.8759999871253967},{"id":"https://openalex.org/keywords/business-process-modeling","display_name":"business process modeling","score":0.5609999895095825},{"id":"https://openalex.org/keywords/automated-verification-tools","display_name":"automated verification tools","score":0.48399999737739563}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7825000286102295},{"id":"https://openalex.org/C2776329536","wikidata":"https://www.wikidata.org/wiki/Q948666","display_name":"Promela","level":3,"score":0.7706999778747559},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7251999974250793},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6642000079154968},{"id":"https://openalex.org/C179299601","wikidata":"https://www.wikidata.org/wiki/Q1017605","display_name":"Business Process Model and Notation","level":5,"score":0.5683000087738037},{"id":"https://openalex.org/C130536060","wikidata":"https://www.wikidata.org/wiki/Q592375","display_name":"XPDL","level":4,"score":0.565500020980835},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.5529999732971191},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.4009999930858612},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.3991999924182892},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3727000057697296},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.36410000920295715},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.34599998593330383},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.3447999954223633},{"id":"https://openalex.org/C4927394","wikidata":"https://www.wikidata.org/wiki/Q787631","display_name":"Business Process Execution Language","level":4,"score":0.3336000144481659},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.3154999911785126},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C35292069","wikidata":"https://www.wikidata.org/wiki/Q1575458","display_name":"Validator","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C11219265","wikidata":"https://www.wikidata.org/wiki/Q5158734","display_name":"Concolic testing","level":4,"score":0.29789999127388},{"id":"https://openalex.org/C146939238","wikidata":"https://www.wikidata.org/wiki/Q2467310","display_name":"UML tool","level":4,"score":0.27469998598098755},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27399998903274536},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.27059999108314514},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C145644426","wikidata":"https://www.wikidata.org/wiki/Q169411","display_name":"Unified Modeling Language","level":3,"score":0.2615000009536743},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icctdc64446.2025.11158756","doi":"https://doi.org/10.1109/icctdc64446.2025.11158756","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icctdc64446.2025.11158756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Conference on Computing Technologies &amp;amp; Data Communication (ICCTDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1,101],"presents":[2],"an":[3,103],"automated":[4,45],"tool":[5,26],"for":[6,57,68],"verifying":[7],"Business":[8],"Process":[9],"Model":[10],"and":[11,19,38,59,65,71,83,116,139],"Notation":[12],"(BPMN)":[13],"workflows":[14],"by":[15,113],"generating":[16],"Promela":[17,41,86],"code":[18],"Linear":[20],"Temporal":[21],"Logic":[22],"(LTL)":[23],"properties.":[24],"The":[25,73],"integrates":[27],"multiple":[28],"phases":[29],"of":[30,47,111,133],"model":[31],"verification,":[32],"starting":[33],"from":[34,50,93],"BPMN":[35,58,81,115,134],"workflow":[36],"ingestion":[37],"translation":[39,70],"into":[40],"models":[42],"to":[43,79],"the":[44,55,100,109,120,126],"generation":[46],"LTL":[48,89],"properties":[49,90],"state":[51,60,97,117],"diagrams.":[52,98],"We":[53],"discuss":[54],"requirements":[56],"diagrams,":[61],"including":[62],"specific":[63],"syntax":[64],"structure":[66],"needed":[67],"accurate":[69],"verification.":[72],"methodology":[74],"employs":[75],"a":[76],"visitor":[77],"pattern":[78],"traverse":[80],"elements":[82],"produce":[84],"verifiable":[85],"code,":[87],"while":[88],"are":[91],"derived":[92],"boolean":[94],"expressions":[95],"in":[96,129,141],"Additionally,":[99],"introduces":[102],"error":[104,121],"visualization":[105],"mechanism":[106],"that":[107],"enhances":[108],"interpretability":[110],"counterexamples":[112],"annotating":[114],"diagrams":[118],"along":[119],"trace.":[122],"Evaluation":[123],"results":[124],"demonstrate":[125],"tool's":[127],"efficacy":[128],"handling":[130],"varying":[131],"complexities":[132],"workflows,":[135],"highlighting":[136],"its":[137],"scalability":[138],"performance":[140],"different":[142],"verification":[143],"scenarios.":[144]},"counts_by_year":[],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2025-10-10T00:00:00"}
