Abstract
We introduce the notion of net-slice to describe a subnet of a marked Petri net Σ that approximates Σ’s temporal behaviour with respect to a set of places P. We consider slices Σ′ whose set of places comprises the places referred to by a CTL* formula φ. If Σ is fair w.r.t. the transitions of a slice, Σ ⊧ φ can be verified and falsified by examining the slice, given φ is a CTL* formula built without using the next-time operator. Verification of LTL\(_{\textrm{-\tiny{X}}}\) formulas is thus possible under these very weak fairness assumptions, though LTL formulas using next-time can be falsified.
This work is supported by the German Research Foundation (DFG), grant GRK 1076/1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Weiser, M.: Program slicing. In: Proceedings of the 5th international conference on Software engineering, pp. 439–449. IEEE Press, Piscataway (1981)
Tip, F.: A survey of program slicing techniques. Journal of programming languages 3, 121–189 (1995)
Sloane, A.M., Holdsworth, J.: Beyond traditional program slicing. In: International Symposium on Software Testing and Analysis, San Diego, CA, pp. 180–186. ACM Press, New York (1996)
Heimdahl, M.P.E., Whalen, M.W.: Reduction and slicing of hierarchical state machines. In: Jazayeri, M. (ed.) ESEC 1997 and ESEC-FSE 1997. LNCS, vol. 1301, pp. 450–467. Springer, Heidelberg (1997)
Chang, J., Richardson, D.J.: Static and dynamic specification slicing. In: Proceedings of the Fourth Irvine Software Symposium (1994)
Brückner, I.: Slicing CSP-OZ specifications. In: Nordic Workshop on Programming Theory (2004)
Brückner, I., Wehrheim, H.: Slicing Object-Z specifications for verification. In: Treharne, H., King, S., Henson, M.C., Schneider, S. (eds.) ZB 2005. LNCS, vol. 3455, pp. 414–433. Springer, Heidelberg (2005)
Chang, C.K., Wang, H.: A slicing algorithm of concurrency modeling based on Petri nets. In: Hwang, K., Jacobs, S.M., Swartzlander, E.E. (eds.) Proc. of the 1986 Int. Conf. on Parallel Processing, Washington, pp. 789–792. IEEE Computer Society Press, Los Alamitos (1987)
Hatcliff, J., Dwyer, M.B., Zheng, H.: Slicing software for model construction. Higher-Order and Symbolic Computation, 315–353 (2000)
Aalst, W.v.d., Hee, K.v.: Workflow Management - Models, Methods, and Systems, pp. 4–62. The MIT Press, Cambridge (2002)
Corbett, J.C.: Evaluating Deadlock Detection Methods for Concurrent Software. IEEE Transactions on Software Engineering 22(3), 161–180 (1996)
Berezin, S., Campos, S., Clarke, E.M.: Compositional reasoning in model checking. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 81–102. Springer, Heidelberg (1998)
Rakow, A.: Slicing Petri Nets. In: Proceedings of the Workshop on FABPWS 2007, Satellite Event, Siedlce, pp. 56–70 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rakow, A. (2008). Slicing Petri Nets with an Application to Workflow Verification. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-77566-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77565-2
Online ISBN: 978-3-540-77566-9
eBook Packages: Computer ScienceComputer Science (R0)