Time Petri net model with mixed semantics

被引：1
|
作者：
Pan L. [1 ,2 ]
Ding Z.-J. [2 ,3 ]
Guo G.-Q. [1 ]
机构：
[1] School of Information and Communication Engineering, Hu'nan Institute of Science and Technology
[2] Department of Computer Science and Technology, Tongji University
[3] State Key Laboratory of Software Engineering, Wuhan University
来源：
Ruan Jian Xue Bao/Journal of Software | 2011年 / 22卷 / 06期
关键词：
Mixed semantics; Schedulability analysis; Time Petri net; Turing equivalence; Undecidability;
D O I：
10.3724/SP.J.1001.2011.04018
中图分类号：
学科分类号：
摘要：
This paper presents a time Petri net (TPN) model with mixed semantics that efficiently addresses the schedulability analysis problem of the existing semantics models. The proposed model associates each firable transition with a mandatory firing point that is set to the least upper bound of the transition and its non-conflicting transitions. This treatment not only eliminates the effect of conflicting transitions on the transition friability and extends the scheduling scope of the TPN model, but also ensures the time limit of the task scheduling. To determine the expressiveness of the mixed model, the study proves that the mixed semantics model has the power of Turing machines and its marking reachability problem is undecidable. The timed expressiveness of three semantics models with respect to timed language acceptance is also compared. A state class approach is then proposed for the scheduling analysis of the mixed model. Finally, a flexible manufacturing system is used as an example to compare the scheduling ability of three semantics models. ©2011 ISCAS.
引用
收藏
页码：1199 / 1209
页数：10
相关论文
共 12 条
  • [1] Merlin P.M., Farber D.J., Recoverability of communication protocols implications of a theoretical study, IEEE Trans. on Communications, 24, 9, pp. 1036-1043, (1976)
  • [2] Berthomieu B., Diaz M., Modeling and verification of time dependent systems using time Petri nets, IEEE Trans. on Software Engineering, 17, 3, pp. 259-273, (1991)
  • [3] Cerone A., Maggiolo-Schettini A., Time-Based expressivity of time Petri nets for system specification, Theoretical Computer Science, 216, 1-2, pp. 1-53, (1999)
  • [4] Boyer M., Roux O.H., Comparison of the expressiveness of arc, place and transition time Petri nets, Proc. of the 28th Int'l Conf. on Application and Theory of Petri Nets and other Models of Concurrency, pp. 63-82, (2007)
  • [5] Felder M., Mandrioli D., Morzenti A., Proving properties of real-time systems through logical specifications and Petri net models, IEEE Trans. on Software Engineering, 20, 2, pp. 127-141, (1994)
  • [6] Koutny M., A compositional model of time Petri nets, Proc. of the 21st Int'l Conf. on Application and Theory of Petri Nets, pp. 303-322, (2000)
  • [7] Esparza J., Decidability and complexity of Petri net problems-An introduction, Proc. of the Lectures on Petri Nets I: Basic Models, pp. 374-428, (1998)
  • [8] Berthomieu B., Lime D., Roux O.H., Vernadat F., Reachability problems and abstract state spaces for time Petri nets with stopwatches, Discrete Event Dynamic System, 17, 2, pp. 133-158, (2007)
  • [9] Alain R.P., Arnaud S., Weak time Petri nets strike back, Proc. of the 20th Int'l Conf. on Concurrency Theory, pp. 557-571, (2009)
  • [10] Wang J.C., Deng Y., Xu G., Reachability analysis of real-time systems using time Petri nets, IEEE Trans. on Systems, Man, and Cybernetics, Part B: Cybernetics, 30, 5, pp. 725-736, (2000)
12