Inhibitor Arcs, TCPNIA) is a model for specifying real-time embedded systems. It integrates features of colored Petri nets, timed Petri nets and inhibitor arcs. The methods for modeling modules of systems using TCPNIA are proposed. A depth-first scheduling algorithm for TCPNIA is proposed. The system level resource’s influence to schedulable path is considered. Different data in tokens will change an execution path and call different data operational functions. The influence from data operational functions is considered in the scheduling algorithm. The time requirement upper bound of a schedulable path can be calculated in the algorithm. Tasks ’ parallel executions have been considered when the time upper bound of the path is calculated. Th...
Abstract. Finding a hard real-time feasible schedule is not trivial since this problem is NP-hard in...
Due to rapidly increasing system complexity, shortening time-tomarket, and growing demand for hard r...
International audienceThis paper addresses the schedulability analysis of real-time systems modeled ...
Abstract: We propose a model oriented scheduling methodology for highly coupled real time applicatio...
Increase in system complexity has made embedded software a very important part of an embedded system...
AbstractWith the computerization of most daily-life human amenities such as home appliances, the sof...
Abstract—As computer systems become increasingly internetworked, a challenging problem faced by rese...
A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorit...
International audienceThe most widely used approach for verifying the schedulability of a real-time ...
A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorit...
International audiencePetri nets are a powerful formalism for the specification and verification of ...
Transforming a software functional model that describes the underlying application to a concurrency ...
Abstract. A resource scheduling algorithm called XMin-min is proposed in this paper. In the XMin-min...
Due to rapidly increasing system complexity, shortening time-to-market, and growing demand for hard ...
Abstract. We present a methodology of o-line analysis of real-time systems, composed of periodic, sy...
Abstract. Finding a hard real-time feasible schedule is not trivial since this problem is NP-hard in...
Due to rapidly increasing system complexity, shortening time-tomarket, and growing demand for hard r...
International audienceThis paper addresses the schedulability analysis of real-time systems modeled ...
Abstract: We propose a model oriented scheduling methodology for highly coupled real time applicatio...
Increase in system complexity has made embedded software a very important part of an embedded system...
AbstractWith the computerization of most daily-life human amenities such as home appliances, the sof...
Abstract—As computer systems become increasingly internetworked, a challenging problem faced by rese...
A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorit...
International audienceThe most widely used approach for verifying the schedulability of a real-time ...
A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorit...
International audiencePetri nets are a powerful formalism for the specification and verification of ...
Transforming a software functional model that describes the underlying application to a concurrency ...
Abstract. A resource scheduling algorithm called XMin-min is proposed in this paper. In the XMin-min...
Due to rapidly increasing system complexity, shortening time-to-market, and growing demand for hard ...
Abstract. We present a methodology of o-line analysis of real-time systems, composed of periodic, sy...
Abstract. Finding a hard real-time feasible schedule is not trivial since this problem is NP-hard in...
Due to rapidly increasing system complexity, shortening time-tomarket, and growing demand for hard r...
International audienceThis paper addresses the schedulability analysis of real-time systems modeled ...