期刊文献+

Petri网共享T型子网合成活性分析

Liveness analysis of Petri Nets Synthesis Shared T-type Subnets
下载PDF
导出
摘要 为解决子系统共享问题,提出了经由Petri网系统共享T-型子网构成共享子网合成网的解决方案。共享T-型子网合成是研究复杂Petri网系统性质的一个有效途径。研究了共享T-型子网合成对参与合成的各网系统的活性的继承关系,给出了合成网保持活性的充分条件或充要条件。随后给出的有关制造系统设计和分析的实例,说明了该合成方法的有效性。本文的结果可为Petri网系统合成的静态和动态性质的考察提供有效途径,对系统的设计和验证具有重要的指导意义。 In order to solve subsystem-sharing problem, a scheme is obtained using synthesis of Petri nets shared T-type subnet. Synthesis of Petri nets shared T-type subnets is an effective method for studying properties of complex Petri nets. The liveness preservation of the synthesis net are investigated. A set of sufficient conditions, or sufficient and necessary conditions are obtained, which can be used to decide liveness of the synthesis net. Application of the synthesis method is illustrated with an example from manufacturing system. These results are useful for studying the static and dynamic properties of Petri nets. The synthesis method is practical to use in system design and verification.
作者 夏传良
出处 《系统仿真学报》 CAS CSCD 北大核心 2007年第A01期4-8,37,共6页 Journal of System Simulation
关键词 PETRI网 合成 活性 有界性 系统设计 Petri nets synthesis liveness boundedness, system design
  • 相关文献

参考文献14

  • 1M D Jeng. A petri net synthesis theory for modeling flexible manufacturing systems [J]. IEEE Transaction on systems, Man, and Cybernetics-Part B: Cybernetics, 1997, 27(2): 169-183.
  • 2M D Jeng, F DiCeare. A review of synthesis techniques for Petri nets with zpplication to automated manufacturing systems [J]. IEEE Transaction on systems, Man, and Cybernetics, 1993, 23(1): 301-312.
  • 3M D Jeng, F DiCeare. Synthesis using control nets for modeling share resouce systems [J]. IEEE Transaction on Systems, Man, and Cybernetics, 1996, 11(3): 317-324.
  • 4夏传良,焦莉,陆维明.Petri网精细化操作及其在系统设计中的应用[J].软件学报,2006,17(1):11-19. 被引量:16
  • 5J Esparza, M Sila. On the analysis and synthesis of free choice systems, [C]//G. Rozenberg. Ed Lecture Notes in Computer Science. New York: Springer-Verlag, 1990, 483: 243-286.
  • 6J Esparza, M Sila. Top-down synthesis of live and bounded free choice nets[C]// G. Rozenberg. Ed Lecture Notes in Computer Science. New York: Springer-Verlag, 1991,524: 118-139.
  • 7E Badouel, Ph Darondeau. The synthesis of Petri nets from path-automatic specifications [J]. Information and Computation 1993, (2004): 117-135.
  • 8Giuliana Franceschinis, Marco Gribaudo, et al. Compositional Modeling of Complex Systems: Contact Center Scenarios in OsMoSys. [C]//Proc the 25^th International Conference on Application and Theory of Petri Nets. Bologna, Italy, 2004: 177-196.
  • 9Gabriel Juhas, Robert Lorenz, et al. Synthesis of Controlled with Modules of Signal Nets[C]//Proc the 25^th International Conference on Application and Theory of Petri Nets. Bologna, Italy, 2004: 238-257.
  • 10Dong-Hoon Yoo, Dong-Ik Lee, et al. Operation Net System: A Formal Design Representation Model for High-Level Synthesis of Asynchronous SyStems Based on Transformations[C]//Proc the 25^th International Conference on Application and Theory of Petri Nets. Bologna, Italy, 2004: 435-453.

二级参考文献43

  • 1Huang H, Cheung TY, Mak WM, Structure and behavior preservation by Petri-net-based refinements in system design, Theoretical Computer Science, 2004,328:245-269.
  • 2Volzer H. Refinement-Robust fairness. In: Brim L, et al., eds. CONCUR 2002. LNCS 2421, Berlin, Heidelberg: Springer-Verlag,2002. 547-562.
  • 3Murata T. Petri nets: Properties, analysis, and applications. Proc. of the IEEE, 1889,77(4):541-580.
  • 4Reisig W. Petri Nets: An Introduction. Berlin, Heidelberg: Spring-Verlag, 1985.
  • 5van der Aalst W, van Hee K, Workflow Management Models, Methods, and Systems. Beijing: Tsinghua University Press, 2004 (in Chinese).
  • 6Lakos C. Composing abstractions of coloured Petri nets. In: Nielsen M, Simpson D, eds. ICATPN 2000. LNCS 1825, Berlin Heidelberg: Springer-Verlag, 2000. 323-342.
  • 7Chrzastowski-Wachtel P, Benatallah B, Hamadi R, O'Dell M, Susanto A. A top-down Petri net-based approach for dynamic workflow modeling. In: van der Aalst WMP, et al., eds. BPM 2003. LNCS 2678, Berlin, Heidelberg: Springer-Verlag, 2003.336-353.
  • 8Felder M, Gargantini A, Morzcnti A. A theorey of implementation and refinement in timed Petri nets. Theoretical Computer Science, 1998,202.127-161.
  • 9Stork DG, van Glabbeek R. Token-Controlled place refinement in hierachical Pctri nets with application to active document workflow. In: Esparza J, Lakos C, eds. ICATPN 2002. LICS 2360, Berlin, Heidelberg: Springer-Verlag, 2002. 394-413.
  • 10Betous-Almeida C, Kanoun K. Construction and stepwise refinement of dependability models. Performance Evaluation, 2004,56:277-306.

共引文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部