Leibniz Trans. Embed. Syst.最新文献_第4页

TLM.open: a SystemC/TLM Frontend for the CADP Verification Toolbox TLM。打开:用于CADP验证工具箱的SystemC/TLM前端

Leibniz Trans. Embed. Syst. Pub Date : 2014-04-25 DOI: 10.4230/LITES-v001-i001-a002

C. Helmstetter

{"title":"TLM.open: a SystemC/TLM Frontend for the CADP Verification Toolbox","authors":"C. Helmstetter","doi":"10.4230/LITES-v001-i001-a002","DOIUrl":"https://doi.org/10.4230/LITES-v001-i001-a002","url":null,"abstract":"SystemC/TLM models, which are C++ programs, allow the simulation of embedded software before hardware low-level descriptions are available and are used as golden models for hardware verification. The verification of the SystemC/TLM models is an important issue since an error in the model can mislead the system designers or reveal an error in the specifications. An open-source simulator for SystemC/TLM is provided but there are no tools for formal verification. In order to apply model checking to a SystemC/TLM model, a semantics for standard C++ code and for specific SystemC/TLM features must be provided. The usual approach relies on the translation of the SystemC/TLM code into a formal language for which a model checker is available. We propose another approach that suppresses the error-prone translation effort. Given a SystemC/TLM program, the transitions are obtained by executing the original code using g++ and an extended SystemC library, and we ask the user to provide additional functions to store the current model state. These additional functions generally represent less than 20% of the size of the original model, and allow it to apply all CADP verification tools to the SystemC/TLM model itself.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131544690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays 考虑缓存相关抢占延迟的固定优先级与EDF调度的比较

Leibniz Trans. Embed. Syst. Pub Date : 2014-04-14 DOI: 10.4230/LITES-v001-i001-a001

Will Lunniss, S. Altmeyer, Robert I. Davis

{"title":"A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays","authors":"Will Lunniss, S. Altmeyer, Robert I. Davis","doi":"10.4230/LITES-v001-i001-a001","DOIUrl":"https://doi.org/10.4230/LITES-v001-i001-a001","url":null,"abstract":"In multitasking real-time systems, the choice of scheduling algorithm is an important factor to ensure that response time requirements are met while maximising limited system resources. Two popular scheduling algorithms include fixed priority (FP) and earliest deadline first (EDF). While they have been studied in great detail before, they have not been compared when taking into account cache related pre-emption delays (CRPD). Memory and cache are split into a number of blocks containing instructions and data. During a pre-emption, cache blocks from the pre-empting task can evict those of the pre-empted task. When the pre-empted task is resumed, if it then has to re-load the evicted blocks, CRPD are introduced which then affect the schedulability of the task. In this paper we compare FP and EDF scheduling algorithms in the presence of CRPD using the state-of-the-art CRPD analysis. We find that when CRPD is accounted for, the performance gains offered by EDF over FP, while still notable, are diminished. Furthermore, we find that under scenarios that cause relatively high CRPD, task layout optimisation techniques can be applied to allow FP to schedule tasksets at a similar processor utilisation to EDF. Thus making the choice of the task layout in memory as important as the choice of scheduling algorithm. This is very relevant for industry, as it is much cheaper and simpler to adjust the task layout through the linker than it is to switch the scheduling algorithm.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128329778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 21

From Dissipativity Theory to Compositional Construction of Control Barrier Certificates 从耗散理论到控制屏障证书的构成

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI: 10.4230/LITES.8.2.6

Ameneh Nejati, Majid Zamani

{"title":"From Dissipativity Theory to Compositional Construction of Control Barrier Certificates","authors":"Ameneh Nejati, Majid Zamani","doi":"10.4230/LITES.8.2.6","DOIUrl":"https://doi.org/10.4230/LITES.8.2.6","url":null,"abstract":"This paper proposes a compositional framework based on dissipativity approaches to construct control barrier certificates for networks of continuous-time stochastic hybrid systems. The proposed scheme leverages the structure of the interconnection topology and a notion of so-called control storage certificates to construct control barrier certificates compositionally. By utilizing those certificates, one can compositionally synthesize state-feedback controllers for interconnected systems enforcing safety specifications over a finite-time horizon. In particular, we leverage dissipativity-type compositionality conditions to construct control barrier certificates for interconnected systems based on corresponding control storage certificates computed for subsystems. Using those constructed control barrier certificates, one can quantify upper bounds on probabilities that interconnected systems reach certain unsafe regions in finite-time horizons. We employ a systematic technique based on the sum-of-squares optimization program to search for storage certificates of subsystems together with their corresponding safety controllers. We demonstrate our proposed results by applying them to a temperature regulation in a circular building containing 1000 rooms. To show the applicability of our approaches to dense networks, we also apply our proposed techniques to a fully-interconnected network .","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114054938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Higher-Dimensional Timed and Hybrid Automata 高维定时和混合自动机

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI: 10.4230/LITES.8.2.3

U. Fahrenberg

引用次数: 2

Safety Verification of Networked Control Systems by Complex Zonotopes 基于复杂区域拓扑的网络控制系统安全性验证

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI: 10.4230/LITES.8.2.1

A. Adimoolam, T. Dang

{"title":"Safety Verification of Networked Control Systems by Complex Zonotopes","authors":"A. Adimoolam, T. Dang","doi":"10.4230/LITES.8.2.1","DOIUrl":"https://doi.org/10.4230/LITES.8.2.1","url":null,"abstract":"Networked control systems (NCS) are widely used in real world applications because of their advantages, such as remote operability and reduced installation costs. However, they are prone to various inaccuracies in execution like delays, packet dropouts, inaccurate sensing and quantization errors. To ensure safety of NCS, their models have to be verified under the consideration of aforemen-tioned uncertainties. In this paper, we tackle the problem of verifying safety of models of NCS under uncertain sampling time, inaccurate output measurement or estimation, and unknown disturbance input. Unbounded-time safety verification requires approximation of reachable sets by invariants, whose computation involves set operations. For uncertain linear dynamics, two important set operations for invariant computation are linear transformation and Minkowski sum operations. Zonotopes have the advantage that linear transformation and Minkowski sum operations can be efficiently approximated. However, they can not encode directions of convergence of trajectories along complex eigenvectors, which is closely related to encoding invariants. Therefore, we extend zonotopes to the complex valued domain by a representation called complex zonotope , which can capture contraction along complex eigenvectors for determining invariants. We prove a related mathematical result that in case of accurate feedback sampling, a complex zonotope will represent an invariant for a stable NCS. In addition, we propose an algorithm to verify the general case based on complex zonotopes, when there is uncertainty in sampling time and in input. We demonstrate the efficiency of our algorithm on benchmark examples and compare it with a state-of-the-art verification tool.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115883787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Introduction to the Special Issue on Distributed Hybrid Systems 分布式混合系统专题导论

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI: 10.4230/LITES.8.2.0

A. Abate, U. Fahrenberg, M. Fränzle

{"title":"Introduction to the Special Issue on Distributed Hybrid Systems","authors":"A. Abate, U. Fahrenberg, M. Fränzle","doi":"10.4230/LITES.8.2.0","DOIUrl":"https://doi.org/10.4230/LITES.8.2.0","url":null,"abstract":"This special issue contains seven papers within the broad subject of Distributed Hybrid Systems , that is, systems combining hybrid discrete-continuous state spaces with elements of concurrency and lo-gical or spatial distribution. It follows up on several workshops on the same theme which were held between 2017 and 2019 and organized by the editors of this volume. The first of these workshops was held in Aal-borg, Denmark, in August 2017 and associated with the MFCS conference. It featured invited talks by Alessandro Abate, Martin Fränzle, Kim G. Larsen, Martin Raussen, and Rafael Wis-niewski. The second workshop was held in Pal-aiseau, France, in July 2018, with invited talks by Luc Jaulin, Thao Dang, Lisbeth Fajstrup, Em-manuel Ledinot, and André Platzer. The third workshop was held in Amsterdam, The Nether-lands, in August 2019, associated with the CONCUR conference. It featured a special theme on distributed robotics and had invited talks by Majid Zamani, Hervé de Forges, and Xavier Urbain. The vision and purpose of the DHS workshops was to connect researchers working in real-time systems, hybrid systems, control theory, formal verification, distributed computing, and concurrency theory, in order to advance the subject of distributed hybrid systems. Such systems are abund-ant and often safety-critical, but ensuring their cor-rect functioning can in general be challenging. The investigation of their dynamics by analysis tools from the aforementioned domains remains frag-mentary, providing the rationale behind the workshops: it was conceived that convergence and interaction of theories, methods, and tools from these different areas was needed in order to advance the subject.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121974382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

HW-Flow: A Multi-Abstraction Level HW-CNN Codesign Pruning Methodology HW-Flow:一种多抽象层次的HW-CNN协同设计剪枝方法

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI: 10.4230/LITES.8.1.3

M. Vemparala, Nael Fasfous, Alexander Frickenstein, Emanuele Valpreda, Manfredi Camalleri, Qi Zhao, C. Unger, N. Nagaraja, Maurizio Martina, W. Stechele

{"title":"HW-Flow: A Multi-Abstraction Level HW-CNN Codesign Pruning Methodology","authors":"M. Vemparala, Nael Fasfous, Alexander Frickenstein, Emanuele Valpreda, Manfredi Camalleri, Qi Zhao, C. Unger, N. Nagaraja, Maurizio Martina, W. Stechele","doi":"10.4230/LITES.8.1.3","DOIUrl":"https://doi.org/10.4230/LITES.8.1.3","url":null,"abstract":"Convolutional neural networks (CNNs) have produced unprecedented accuracy for many computer vision problems in the recent past. In power and compute-constrained embedded platforms, deploying modern CNNs can present many challenges. Most CNN architectures do not run in real-time due to the high number of computational operations involved during the inference phase. This emphasizes the role of CNN optimization techniques in early design space exploration. To estimate their efficacy in satisfying the target constraints, existing techniques are either hardware (HW) agnostic, pseudo-HW-aware by considering parameter and operation counts, or HW-aware through inflexible hardware-in-the-loop (HIL) setups. In this work, we introduce HW-Flow, a framework for optimizing and exploring CNN models based on three levels of hardware abstraction: Coarse, Mid and Fine. Through these levels, CNN design and optimization can be iteratively refined towards efficient execution on the target hardware platform. We present HWFlow in the context of CNN pruning by augmenting a reinforcement learning agent with key metrics to understand the influence of its pruning actions on the inference hardware. With 2× reduction in energy and latency, we prune ResNet56, ResNet50, and DeepLabv3 with minimal accuracy degradation on the CIFAR-10, ImageNet, and CityScapes datasets, respectively. 2012 ACM Subject Classification Computing Methodologies → Artificial intelligence","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130909104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Per Processor Spin-Based Protocols for Multiprocessor Real-Time Systems 基于自旋的多处理器实时系统协议

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI: 10.4230/LITES-v004-i002-a003

Sara Afshar, M. Behnam, R. J. Bril, Thomas Nolte

引用次数: 10

Micro- and Macroscopic Road Traffic Analysis using Drone Image Data 基于无人机图像数据的道路交通微观与宏观分析

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI: 10.4230/LITES.8.1.2

Friedrich Kruber, Eduardo Sánchez Morales, R. Egolf, Jonas Wurst, S. Chakraborty, M. Botsch

{"title":"Micro- and Macroscopic Road Traffic Analysis using Drone Image Data","authors":"Friedrich Kruber, Eduardo Sánchez Morales, R. Egolf, Jonas Wurst, S. Chakraborty, M. Botsch","doi":"10.4230/LITES.8.1.2","DOIUrl":"https://doi.org/10.4230/LITES.8.1.2","url":null,"abstract":"The current development in the drone technology, alongside with machine learning based image processing, open new possibilities for various applications. Thus, the market volume is expected to grow rapidly over the next years. The goal of this paper is to demonstrate the capabilities and limitations of drone based image data processing for the purpose of road traffic analysis. In the first part a method for generating microscopic traffic data is proposed. More precisely, the state of vehicles and the resulting trajectories are estimated. The method is validated by conducting experiments with reference sensors and proofs to achieve precise vehicle state estimation results. It is also shown, how the computational effort can be reduced by incorporating the tracking information into a neural network. A discussion on current limitations supplements the findings. By collecting a large number of vehicle trajectories, macroscopic statistics, such as traffic flow and density can be obtained from the data. In the second part, a publicly available drone based data set is analyzed to evaluate the suitability for macroscopic traffic modeling. The results show that the method is well suited for gaining detailed information about macroscopic statistics, such as traffic flow dependent time headway or lane change occurrences. In conclusion, this paper presents methods to ex-ploit the remarkable opportunities of drone based image processing for joint macro- and microscopic traffic analysis.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115138523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Bayesian Hybrid Automata: A Formal Model of Justified Belief in Interacting Hybrid Systems Subject to Imprecise Observation 贝叶斯混合自动机:受不精确观测影响的相互作用混合系统的合理信念的形式化模型

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI: 10.4230/LITES.8.2.5

P. Kröger, M. Fränzle

{"title":"Bayesian Hybrid Automata: A Formal Model of Justified Belief in Interacting Hybrid Systems Subject to Imprecise Observation","authors":"P. Kröger, M. Fränzle","doi":"10.4230/LITES.8.2.5","DOIUrl":"https://doi.org/10.4230/LITES.8.2.5","url":null,"abstract":"Hybrid discrete-continuous system dynamics arises when discrete actions, e.g. by a decision al-gorithm, meet continuous behaviour, e.g. due to physical processes and continuous control. A nat-ural domain of such systems are emerging smart technologies which add elements of intelligence, cooperation, and adaptivity to physical entities, enabling them to interact with each other and with humans as systems of (human-)cyber-physical systems or (H)CPSes. Various flavours of hybrid automata have been suggested as a means to formally analyse CPS dynamics. In a previous article, we demonstrated that all these variants of hybrid automata provide inaccurate, in the sense of either overly pessimistic or overly optimistic, verdicts for engineered systems operating under imprecise observation of their environment due to, e.g., measurement error. We suggested a revised formal model, called Bayesian hybrid automata, that is able to represent state tracking and estimation in hybrid systems and thereby enhances precision of verdicts obtained from the model in comparison to traditional model variants. In this article, we present an extended definition of Bayesian hybrid automata which incorporates a new class of guard and invariant functions that allow to evaluate traditional guards and invariants over probability distributions. The resulting framework allows to model observers with knowledge about the control strategy of an observed agent but with imprecise estimates of the data on which the control decisions are based.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130471351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1