Abstract
The design and the analysis of business processes commonly relies on workflow nets, a suited class of Petri nets. This paper evaluates and compares two resolution methods—Satisfiability Modulo Theory (SMT) and Constraint Logic Programming (CLP)—applied to the verification of modal specifications over workflow nets. Firstly, it provides a concise description of the verification methods based on constraint solving. Secondly, it presents the experimental protocol designed to evaluate and compare the scalability and efficiency of both resolution approaches. Thirdly, the paper reports on the obtained results and discusses the lessons learned from these experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Bride, H., Kouchnarenko, O., Peureux, F.: Verifying modal workflow specifications using constraint solving. In: Albert, E., Sekerinski, E. (eds.) IFM 2014. LNCS, vol. 8739, pp. 171–186. Springer, Heidelberg (2014)
Tsang, E.P.K.: Foundations of Constraint Satisfaction. Computation in Cognitive Science. Academic Press, San Diego (1993)
De Moura, L., Bjørner, N.: Satisfiability modulo theories: Introduction and applications. Commun. ACM 54(9), 69–77 (2011)
van der Aalst, W.M.P.: The application of Petri nets to workflow management. J. Circ. Syst. Comput. 08(01), 21–66 (1998)
Murata, T.: Petri nets: properties, analysis and applications. IEEE 77(4), 541–580 (1989)
de Moura, L., Bjørner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)
Carlsson, M., et al.: SICStus Prolog User’s Manual (Release 4.2.3). Swedish Institute of Computer Science, Kista (2012)
Bi, H., Zhao, J.: Applying propositional logic to workflow verification. Inf. Technol. Manag. 5(3–4), 293–318 (2004)
Wimmel, H., Wolf, K.: Applying CEGAR to the Petri net state equation. Logical Methods Comput. Sci. 8(3), 827–846 (2012)
Haddad, S.: Decidability and complexity of Petri net problems. In: Petri Nets: Fundamental Models, Verification and Applications, pp. 87–122 (2009)
Larsen, K., Thomsen, B.: A modal process logic. In: Proceedings of the Third Annual Symposium on Logic in Computer Science, LICS 1988, pp. 203–210 (1988)
Kouchnarenko, O., Sidorova, N., Trcka, N.: Petri nets with may/must semantics. In: Workshop on Concurrency, Specification, and Programming, CS&P 2009, Kraków-Przegorzaly, Poland, vol. 1, September 2009
Monakova, G., Kopp, O., Leymann, F., Moser, S., Schäfers, K.: Verifying business rules using an SMT solver for BPEL processes. In: BPSC. LNI, vol. 147, pp. 81–94. GI (2009)
Pólrola, A., Cybula, P., Meski, A.: Smt-based reachability checking for bounded time Petri nets. Fundam. Inform. 135(4), 467–482 (2014)
Kleine, M., Göthel, T.: Specification, verification and implementation of business processes using CSP. In: TASE, pp. 145–154. IEEE Computer Society (2010)
Soliman, S.: Finding minimal p/t-invariants as a CSP. In: Proceedings of the 4th Workshop on Constraint Based Methods for Bioinformatics, WCB, vol. 8 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Bride, H., Kouchnarenko, O., Peureux, F., Voiron, G. (2016). Workflow Nets Verification: SMT or CLP?. In: ter Beek, M., Gnesi, S., Knapp, A. (eds) Critical Systems: Formal Methods and Automated Verification. AVoCS FMICS 2016 2016. Lecture Notes in Computer Science(), vol 9933. Springer, Cham. https://doi.org/10.1007/978-3-319-45943-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-45943-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45942-4
Online ISBN: 978-3-319-45943-1
eBook Packages: Computer ScienceComputer Science (R0)