Synthesis and reduction of state machine workflow nets
作者： A.A. Di Bucchianico , L. Hakobyan , I. Corro Ramos , K.M. van Hee
DOI:
关键词: Finite-state machine 、 Theoretical computer science 、 Process architecture 、 Stochastic Petri net 、 Computer science 、 Reduction (complexity) 、 Completeness (order theory) 、 Soundness 、 Workflow 、 Petri net
摘要: We present two rules for generating State Machine Workflow (SMWf) nets. prove the soundness of these rules, i.e., we show that applying to an SMWf net results in net. also completeness, any can be obtained by our initial containing one transition only. proofs based on synthesis and reduction.
tue.nl 参考文章(6)
Jörg Desel, Javier Esparza, Free choice Petri nets ,(1995)
Jörg Desel, Reduction and Design of Well-behaved Concurrent Systems international conference on concurrency theory. pp. 166- 181 ,(1990) , 10.1007/BFB0039059
R. Valette, Analysis of petri nets by stepwise refinements Journal of Computer and System Sciences. ,vol. 18, pp. 35- 46 ,(1979) , 10.1016/0022-0000(79)90050-3
T. Murata, Petri nets: Properties, analysis and applications Proceedings of the IEEE. ,vol. 77, pp. 541- 580 ,(1989) , 10.1109/5.24143
Ichiro Suzuki, Tadao Murata, A method for stepwise refinement and abstraction of Petri nets Journal of Computer and System Sciences. ,vol. 27, pp. 51- 76 ,(1983) , 10.1016/0022-0000(83)90029-6
G. Berthelot, Transformations and decompositions of nets Advances in Petri nets 1986, part I on Petri nets: central models and their properties. pp. 359- 376 ,(1987) , 10.1007/978-3-540-47919-2_13