Qualitative analysis of workflow nets using linear logic: soundness verification

Authors:
Lígia Maria Soares Passos;Stéphane Julia
Affiliations:
Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, Brazil;Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, Brazil
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 7
Cited 0

Linear logic

Theoretical Computer Science
Verification of Workflow Nets

ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Scenario Durations Characterization of T-Timed Petri Nets Using Linear Logic

PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Reachability and Temporal Conflicts in t-Time Petri Nets

PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Workflow Management: Models, Methods, and Systems

Workflow Management: Models, Methods, and Systems
Applying Propositional Logic to Workflow Verification

Information Technology and Management
Normalized workflow net (NWF-net): Its definition and properties

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for the qualitative analysis of WorkFlow nets based on the proof trees of linear logic. The analysis is concerned with the proof of the correctness criterion Soundness defined for WorkFlow nets. To prove the Soundness property, a proof tree of linear logic is built for each different scenario of the WorkFlow net. Based on this approach, a method is proposed to verify in linear time if the WorkFlow net is sound.