Abstract
Petri net synthesis can avoid the state exploration problem, which is of exponential complexity, by guaranteeing the correctness in the Petri net while incrementally expanding the net. The conventional Petri net synthesis approaches, in general, suffer the drawback of only being able to synthesize a few classes of nets, such as state machines, marked graphs or asymmetric choice(AC) nets. However, the synthesis technique of Petri nets shared PP-type subnets can synthesize Petri nets beyond AC nets. One major advantage of the synthesis technique is that the resultant Petri net is guaranteed to be live, bounded and reversible. Most current synthesis techniques cannot handle systems with shared subsystems. To solve resource-sharing problem, Jiao L. presented the conditions for an AC net satisfying siphon-trap-property (ST-property) to be live, bounded and reversible[3]. The major motivation of this work is to generalize the results in [3] and to extend the resource-sharing technique to subsystem-sharing technique on AC nets or Petri nets beyond AC nets.
This work was financially supported by the National Natural Science Foundation of China under Grant No. 60073013.
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
Agerwala, T., Choed-Amphai, Y.: A synthesis rule for current systems. In: Proc. 15th Design Automation Conf. LasVegas, pp. 305–311 (June 1978)
Badouel, E., Darondeau., P.: The synthesis of Petri nets from path-automatic specifications. Infomation and Computation 193, 117–135 (2004)
Jiao, L., Cheung, T.Y., Lu, W.M.: On liveness and boundedness of asymmetric choice nets. Theoretical Computer Science 311, 165–197 (2004)
Franceschinis, G., Gribaudo, M., et al.: Compositional Modeling of complex systems: contact center scenarios in OsMoSys. In: Proc. 25th International Conference on Application and Theory of Petri nets, Bologna, Italy, pp. 177–196 (2004)
Juhás, G., Lorenz, R., et al.: Synthesis of controlled with modules of signal nets. In: Proc. 25th International Conference on Application and Theory of Petri nets, Bologna, Italy, pp. 238–257 (2004)
Yoo, D.H., Lee, D. et al: Operation net system: A formal design representation model for high-level synthesis of asynchronous systems based on transformations. In: Proc. 25th International Conference on Application and Theory of Petri nets, Bologna, Italy, pp. 435–453 (2004)
Mäkelä, M.: Model cheching safty properties in modular high-level nets. In: Proc. 24th International Conference on Application and Theory of Petri nets, Eindhoven, The Netherlands, pp. 201–219 (2003)
Hee, K.v., Sidorova, N., et al.: Soundness and separability of workflow nets in the stepwise refinement. In: Proc. 24th International Conference on Application and Theory of Petri nets, Eindhoven, The Netherlands, pp. 337–356 (2003)
Chen, H.X.: Control synthesis of Petri nets based on S-Decreases. Discrete event dynamic systems: Theorey and Applications 10, 233–249 (2000)
Christensen, S., Petrucci, L.: Modular analysis of Petri nets. The Computer Journal 43, 224–242 (2000)
Chao, D.Y.: Petri net synthesis and synchronization using knitting technique. Journal of Information Science and Engineering 15, 543–568 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, C. (2006). Analysis of Properties of Petri Synthesis Net. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_55
Download citation
DOI: https://doi.org/10.1007/11750321_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)