| 1. |
|
|
| 2. |
|
|
| 3. |
- Abdullah, Jakaria, et al.
(författare)
-
Towards a Tool : TIMES-Pro for Modeling, Analysis, Simulation and Implementation of Cyber-Physical Systems
- 2017
-
Ingår i: MODELS, ALGORITHMS, LOGICS AND TOOLS. - Cham : SPRINGER INTERNATIONAL PUBLISHING AG. - 9783319631219 - 9783319631202 ; , s. 623-639
-
Konferensbidrag (refereegranskat)abstract
- We consider a Cyber-Physical System (CPS) as a network of components that are either physical plants with continuous behaviors or discrete controllers. To build CPS's in a systematic manner, the TIMES-Pro tool is designed to support modeling, analysis and code generation for real-time simulation and final deployment. In this paper, we present our decisions in designing the modeling language, the tool architecture and features of TIMES-Pro, and also a case study to demonstrate its applicability.
|
|
| 4. |
- Abdullah, Jakaria, et al.
(författare)
-
Worst-Case Cause-Effect Reaction Latency in Systems with Non-Blocking Communication
- 2019
-
Ingår i: Design, Automation & Test in Europe Conference & Exhibition. - : IEEE. - 9783981926323 ; , s. 1625-1630
-
Konferensbidrag (refereegranskat)abstract
- In real-time embedded systems, a system functionality is often implemented using a data-flow chain over a set of communicating tasks. A critical non-functional requirement in such systems is to restrict the amount of time, i.e. cause-effect latency, for an input to impact its corresponding output. The problem of estimating the worst-case cause-effect latency is well-studied in the context of blocking inter-task communication. Recent research results show that non-blocking communication preserving functional semantics is critical for the model-based design of dynamically updatable systems. In this paper, we study the worst-case cause-effect reaction latency estimation problem in the context of non-blocking inter-task communication. We present a computationally efficient algorithm that tightly over-approximates the exact worst-case reaction latency in cause-effect data-flow chains.
|
|
| 5. |
|
|
| 6. |
- Abdullah, Syed Md Jakaria, et al.
(författare)
-
Towards Implementation of Virtual-Clustered Multiprocessor Scheduling in Linux
- 2013
-
Ingår i: Proceedings of the 8th IEEE International Symposium on Industrial Embedded Systems, SIES 2013. - 9781479906581 ; , s. 97-100
-
Konferensbidrag (refereegranskat)abstract
- Cluster based multiprocessor scheduling can be seen as a hybrid approach combining benefits of both partitioned and global scheduling. Virtual clustering further enhances it by providing dynamic cluster resource allocation and applying hierarchical scheduling techniques. Over the years, the study of virtual cluster scheduling has been limited to theoretical analysis. In this paper, we present our initial ideas about implementing virtual cluster scheduling in Linux. The purpose of this implementation is twofold: (i) we would like to demonstrate the feasibility of its implementation in an operating system, without modifying the kernel source code, (ii) we present practical insights on the overhead of implementing this framework.
|
|
| 7. |
- Guan, Nan, et al.
(författare)
-
Scalable timing analysis with refinement
- 2015
-
Ingår i: Tools and Algorithms for the Construction and Analysis of Systems. - Berlin, Heidelberg : Springer. - 9783662466803 ; , s. 3-18
-
Konferensbidrag (refereegranskat)
|
|
| 8. |
- Mohaqeqi, Morteza, et al.
(författare)
-
An executable semantics for synchronous task graphs : From SDRT to Ada
- 2017
-
Ingår i: Reliable Software Technologies — Ada-Europe 2017. - Cham : Springer. - 9783319605876 ; , s. 137-152
-
Konferensbidrag (refereegranskat)abstract
- We study a graph-based real-time task model in which inter-task synchronization can be specified through a rendezvous mechanism. Previously, efficient methods have been proposed for timing analysis of the corresponding task sets. In this paper, we first formally specify an operational semantics for the model. Next, we describe a method for Ada code generation for a set of such task graphs. We also specify extensions of the approach to cover a notion of broadcasting, as well as global inter-release separation time of real-time jobs. We have implemented the proposed method in a graphical tool which facilitates a model-based design and implementation of real-time software.
|
|
| 9. |
|
|
| 10. |
|
|
