J.J.P. Tsai, S.J. Yang, and Y.-H. Chang, "Timing Constraint Petri Nets and Their Application to Schedulability Analysis of RealTime System Specifications," IEEE Trans. Software Eng., vol. 21, no. 1, pp. 32-49, Jan. 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of program implementation was proposed. In [5] an approach to monitor and verify the task executions was presented. Representatives of schedulability analysis based on specifications include the real time logic technique by Jahanian and Mok [6] and the Petri net based technique by Tsai et al. [11]. Our work studies schedulability analysis of specifications modeled in time Petri nets [8] As a visual model, time Petri nets (TPNs) have been proven very convenient for expressing timing constraints in time dependent systems. TPNs associate transitions with time pairs instead of single delays ....

....PN. The occurrence sequence # is then analyzed to verify whether # is schedulable or M n is reachable by means of # with the timing constraints. Tsai et al. employed this approach for the schedulability analysis of real time system specifications modeled by timing constraint Petri nets (TCPNs) [11]. TCPNs extend Petri nets by associating a minimum maximum timing constraint with each transition and place, and associating a duration constraint for firing each transition. Different from TPNs and timed PNs, TCPNs use the weak firing rule. TCPNs are more expressive, but more complicated to use. ....

[Article contains additional citation context not shown here]

J.J.P. Tsai, S.J. Yang, and Y.-H. Chang, "Timing Constraint Petri Nets and Their Application to Schedulability Analysis of RealTime System Specifications," IEEE Trans. Software Eng., vol. 21, no. 1, pp. 32-49, Jan. 1995.

....of program implementation was proposed. In [5] an approach to monitor and verify the task executions was presented. Representatives of schedulability analysis based on specifications include the real time logic technique by Jahanian and Mok [6] and the Petri net based technique by Tsai et al. [11]. Our work studies schedulability analysis of specifica tions modeled in time Petri nets [8] As a visual model, time Petri nets (TPNs) have been proven very convenient for expressing timing constraints in time dependent systems. TPNs associate transitions with time pairs instead of single ....

....PN. The occurrence sequence (5 is then analyzed to verify whether (5 is schedulable or Mn is reachable by means of (5 with the timing constraints. Tsai et al. employed this approach for the schedulability analysis of real time system specifications modeled by timing constraint Petri nets (TCPNs) [11]. TCPNs extend Petri nets by associating a minimum maximum timing constraint with each transition and place, and associating a duration constraint for firing each transition. Different from TPNs and timed PNs, TCPNs use the weak firing rule. TCPNs are more expressive, but more complicated to use. ....

[Article contains additional citation context not shown here]

J.J.P. Tsai, S.J. Yang, and Y.-H. Chang, "Timing Constraint Petri Nets and Their Application to Schedulability Analysis of RealTime System Specifications," IEEE Trans. Software Eng., vol. 21, no. 1, pp. 32-49, Jan. 1995.

....of program implementation was proposed. In [5] an approach to monitor and verify the task executions was presented. Representatives of schedulability analysis based on specifications include the real time logic technique by Jahanian and Mok [6] and the Petri net based technique by Tsai et al. [11]. Our work studies schedulability analysis of specifications modeled in time Petri nets [8] As a visual model, time Petri nets (TPNs) have been proven very convenient for expressing timing constraints in time dependent systems. TPNs associate transitions with time pairs instead of single delays ....

....PN. The occurrence sequence d is then analyzed to verify whether d is schedulable or M n is reachable by means of d with the timing constraints. Tsai and Yang employed this approach for the schedulability analysis of real time system specifications modeled by timing constraint Petri nets (TCPNs) [11]. TCPNs extend Petri nets by associating a minimum maximum timing constraint with each transition and place and associating a duration constraint for firing each transition. Different from TPNs and timed PNs, TCPNs use the weak firing rule. TCPNs are more expressive, but more complicated to use. ....

[Article contains additional citation context not shown here]

J. J. P. Tsai, S. J. Yang, and Y.-H. Chang, Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications, IEEE Trans. Software Engineering, Vol. 21, No.1, 1995, pp.32-49.

.... up of a set of states, a set of actions, and a succession relation associating states through actions [11] The state transition graph makes explicit such properties as deadlock and reachability [14] and allows for the automatic verification of ordering relationships among task execution times [12]. Two major approaches for the reachability analysis of TPN models are classical state classes [5] and clockstamped state classes [13] As will be discussed in detail, however, there are two issues that these approaches have not effectively or efficiently addressed: 1) how to facilitate the ....

....ST i = min x a, x b , max y a, y b ] x a, y b] Because the time span that the TPN runs from C i to C j is independent of the starting time, so it follows from Theorem 1 that the time span is [x, y] or ST j ST i . o Corollary 1 is very useful for timeliness analysis. As mentioned in [12], the key issue of timeliness analysis is to verify whether a marking can be reached with timing constraints. Corollary 1 shows that the 10 concept of GSC classes helps establish quantitative timing relationship between any two reachable classes in a firing schedule. C. Reachability Analysis ....

J. J. P. Tsai, S. J. Yang, and Y. H. Chang, "Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications," IEEE Transactions on Software Engineering, vol. 21, pp. 32-49, 1995.

....state of the art of programming language semantics, applying it to this particular domain, without reinventing rotating wheels, as it were. Additionally, the visual language community has been engaged in trying to formalize image related descriptions and behaviour for some time (most recently e.g. [9,10,12,18,19]) lessons can be drawn from that experience. A third source of inspiration is mathematics, and the ways that mathematicians have tried to lay a solid foundation for that subject: programming languages can be characterized as notations for describing particular kinds of mathematical relationships, ....

J Tsai, S Yang and Y-H Chang, Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications (IEEE Trans SoftEng 21 1, Jan 1995) 32-49.

....causing a transition of the state. This approach is also called operational . These are the techniques most widespread in industrial use, and the most readily grasped. Model oriented methods for specifying the behaviour of sequential programs and abstract data types include Parnas statemachines [Tsa95]; VDM [Jon86] and Z [Sp88, Sp92] Methods for specifying the behaviour of concurrent and distributed systems include Petri nets; Milner s Calculus of Communicating Systems (CSS) and Hoare s Communicating Sequential Systems (CSP) Hoa85] The process algebras exemplified by CSP allow a system to ....

Tsai J.P., Yang S. J. and Chang Y.H. "Timing Constraint Petri Nets and their Application to Schedulability Analysis of Real-Time System Specifications ". IEEE Transactions on Software Engineering, vol. 21, no. 1, January 1995, pp. 32--49.

....thus starting a new cycle of the control loop. 5 Analysis of an Actor based CPN Model The analysis process of an actor based CPN model aims at verifying and possibly correcting the specification of timing constraints and action worst case execution times in order to ensure schedulability (e.g. Tsai et al. 1995). In particular, the analysis has to assert that every thread is completed within its deadline. Both informal and formal analysis methods can be applied. The informal analysis can be conducted by simulating the model (specifications testing (Ghezzi et al. 1991) i.e. by providing an initial ....

Tsai J.J.P., S.J. Yang and Y.-H. Chang (1995). Timing Constraints Petri Nets and their application to schedulability analysis of real-time system specification. IEEE Trans. on Software Engineering, 21(1), pp. 32-49, January.

....structures of considerable complexity. 4 Temporal Spaces The value of the relational approach outlined above can be illustrated by applying it to the domain of temporal logic programming. There are a wide variety of different temporal logics (e.g. 1,2,8] and ways of describing them (e.g. [3,4,5,10,11]) despite work in combining such logics (e.g. 6] it does not seem easy to compose program components in the traditional way. The following offers a naive view of how heterogeneous temporal structures can be constructed; it is meant primarily for illustrative purposes. The simplest model of ....

J Tsai, S Yang and Y-H Chang, Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications (IEEE Trans SoftEng 21 1, Jan 1995) 32-49.

....combination of specification, execution, or analysis, but rarely all three. PERTS [Liu92,93a,93b] uses a task graph model for simulation, specification, scheduling and analysis. Real Time Euclid [Kligerman86] Stoyenko87] uses a data flow model for analysis. Variants of timed Petri nets [Bruno93][Tsai93] are used for specification and analysis of portions of real time systems. A similar approach is semantically extended data flow diagrams [France92] A major drawback to the use of Petri nets is that they do not specify functional behavior. Statecharts may also be used for specification and ....

Tsai, J. P., S. J. H. Yang, and Y. H. Chang, "Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time Systems," Proceedings of the Workshop on Parallel and Distributed Real-Time Systems, pp. 211-215, Newport Beach, California, April 1993.

....and readers to use operational intuitions. In contrast, functional reasoning starts at the end and works backwards. Furthermore, lazy and eager evaluation strategies yield different results; this ambiguity is less important in dataflow. Reasoning about the temporal properties of programs [4,5,7,8] seems easier with dataflow; guards appear earlier, so less effort is needed in deciding which branches need to be pruned off where. It is less important to have to know about the semantics of components (e.g. strictness properties) This is especially important when there are connections between ....

J Tsai, S Yang and Y-H Chang, Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications (IEEE Trans SoftEng 21 1, Jan 1995) 32-49.

....We illustrate the use and benefits of our reduction rules by modeling and analyzing the response time of a command and control system to its external arriving messages. 1. INTRODUCTION Time Petri nets (TPN s) have been used for the modeling and verification of various time dependent systems [1,2,3,6,7,9]. The analysis of a TPN is normally based on the enumerative technique developed by Berthomieu et al. 1,2] For a complex or even middle sized TPN, however, it is difficult to enumerate its reachable states, which is commonly referred as stateexplosion problem. Sloan et al. developed several ....

J. Tsai, S. Yang, and Y. Chang, timing constraint Petri nets and their application to schedulability analysis of real-time system specifications, IEEE Transactions on Software

....of programming language semantics, applying it to this particular domain, without reinventing rotating wheels, as it were. Another observation is that the visual language community has been engaged in trying to formalize image related descriptions and behaviour for some time (most recently e.g. [9,10,12,18,19]) and that lessons can be drawn from that experience. A third place to look for inspiration is directly to mathematics, and the ways that mathematicians have tried to lay a solid foundation for that subject; after all, programming languages can be characterized as notations for describing ....

J Tsai, S Yang and Y-H Chang, Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications (IEEE Trans SoftEng 21 1, Jan 1995) 32-49.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC