Pub Date : 2016-04-12DOI: 10.1109/DCPS.2016.7588296
Jeffrey C. Murphy, B. Shivkumar, Lukasz Ziarek
Functional programming languages play an important role in the development of provably correct software systems. As embedded devices become pervasive and perform critical tasks in our lives, their reliability becomes paramount. This presents a natural opportunity to explore the application of functional programming languages to systems that demand highly predictable behavior. In this paper we explore existing functional programming language compilers and their applicability to realtime, embedded systems.
{"title":"Real-time capabilities in functional languages","authors":"Jeffrey C. Murphy, B. Shivkumar, Lukasz Ziarek","doi":"10.1109/DCPS.2016.7588296","DOIUrl":"https://doi.org/10.1109/DCPS.2016.7588296","url":null,"abstract":"Functional programming languages play an important role in the development of provably correct software systems. As embedded devices become pervasive and perform critical tasks in our lives, their reliability becomes paramount. This presents a natural opportunity to explore the application of functional programming languages to systems that demand highly predictable behavior. In this paper we explore existing functional programming language compilers and their applicability to realtime, embedded systems.","PeriodicalId":187873,"journal":{"name":"2016 1st CPSWeek Workshop on Declarative Cyber-Physical Systems (DCPS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127430522","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}
Pub Date : 2016-04-12DOI: 10.1109/DCPS.2016.7588298
K. Ravindran
Networked embedded software systems incorporate varying degrees of adaptation behavior to sustain their operations with acceptable quality of service (QoS), in the face of hostile external events (resource outages, component failures, etc). For e.g., a high-availability air-traffic map data service increases the number of replica servers to counter attacks on the data hosting nodes. With the high complexity of such adaptive systems, their trustworthiness in responding to hostile external events should be assessed. The paper formulates model-based assessment techniques to measure how trustworthy a networked software system S is. We benchmark the QoS capability of S by a stress-testing of S with artificially injected failures. As case study in CPS domains, we describe the model-based assessment of collision avoidance systems in automobiles.
{"title":"Dependability assessment of networked embedded software systems","authors":"K. Ravindran","doi":"10.1109/DCPS.2016.7588298","DOIUrl":"https://doi.org/10.1109/DCPS.2016.7588298","url":null,"abstract":"Networked embedded software systems incorporate varying degrees of adaptation behavior to sustain their operations with acceptable quality of service (QoS), in the face of hostile external events (resource outages, component failures, etc). For e.g., a high-availability air-traffic map data service increases the number of replica servers to counter attacks on the data hosting nodes. With the high complexity of such adaptive systems, their trustworthiness in responding to hostile external events should be assessed. The paper formulates model-based assessment techniques to measure how trustworthy a networked software system S is. We benchmark the QoS capability of S by a stress-testing of S with artificially injected failures. As case study in CPS domains, we describe the model-based assessment of collision avoidance systems in automobiles.","PeriodicalId":187873,"journal":{"name":"2016 1st CPSWeek Workshop on Declarative Cyber-Physical Systems (DCPS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123774546","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}
Pub Date : 2016-04-12DOI: 10.1109/DCPS.2016.7588297
V. Estivill-Castro, R. Hexel, Alberto Ramirez Regalado
We incorporate logic programs (in particular Prolog) into reactive systems. We do this using Logic-labeled finitestate machines (LLFSMs), whose non-event-driven nature results in a deterministic schedule. We also advocate the use of a middleware under the Pull-approach, as opposed to the, currently very common, Push-approach, achieving deterministic semantics and the ability to ensure correctness in both the time and value domains. The deterministic schedule has other advantages, such as bounded resource use for inter-process communication as well as a smaller state space for formal verification. We demonstrate this architecture through a simple case study, contrasting the current prevalent Push approach in ROS [1] with the Pull approach recommended for LLFSMs.
{"title":"Architecture for logic programing with arrangements of finite-state machines","authors":"V. Estivill-Castro, R. Hexel, Alberto Ramirez Regalado","doi":"10.1109/DCPS.2016.7588297","DOIUrl":"https://doi.org/10.1109/DCPS.2016.7588297","url":null,"abstract":"We incorporate logic programs (in particular Prolog) into reactive systems. We do this using Logic-labeled finitestate machines (LLFSMs), whose non-event-driven nature results in a deterministic schedule. We also advocate the use of a middleware under the Pull-approach, as opposed to the, currently very common, Push-approach, achieving deterministic semantics and the ability to ensure correctness in both the time and value domains. The deterministic schedule has other advantages, such as bounded resource use for inter-process communication as well as a smaller state space for formal verification. We demonstrate this architecture through a simple case study, contrasting the current prevalent Push approach in ROS [1] with the Pull approach recommended for LLFSMs.","PeriodicalId":187873,"journal":{"name":"2016 1st CPSWeek Workshop on Declarative Cyber-Physical Systems (DCPS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131635652","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}
Pub Date : 2016-04-12DOI: 10.1109/DCPS.2016.7588295
Xingliang Zou, A. Cheng, Yu Jiang
Functional Reactive Programming (FRP) is a declarative approach for modeling and building reactive systems. The FRP has been shown to be an expressive formalism for building graphics, robotic, and vision applications. The Priority-based FRP (P-FRP) is a formalism of FRP that allows preemption of execution and guarantees real-time response. Since functional programs cannot maintain state and mutable data, changes made by programs that are preempted have to be rolled back, and the work done by the preempted programs has to be discarded. Hence in the P-FRP model, a preempted lower priority task will have to restart after higher priority tasks have completed execution. Current real-time research mainly focuses on the classic preemptive or non-preemptive models and plenty methods have been developed to analyze the real-time guarantees of these models. Unfortunately, due to its transactional nature where preempted tasks are aborted and have to restart, the execution semantics of the P-FRP model does not fit into the standard definitions of classic preemptive or non-preemptive execution. In this survey paper, we review existing researches on the P-FRP task scheduling, and present a few research areas for future work.
{"title":"P-FRP task scheduling: A survey","authors":"Xingliang Zou, A. Cheng, Yu Jiang","doi":"10.1109/DCPS.2016.7588295","DOIUrl":"https://doi.org/10.1109/DCPS.2016.7588295","url":null,"abstract":"Functional Reactive Programming (FRP) is a declarative approach for modeling and building reactive systems. The FRP has been shown to be an expressive formalism for building graphics, robotic, and vision applications. The Priority-based FRP (P-FRP) is a formalism of FRP that allows preemption of execution and guarantees real-time response. Since functional programs cannot maintain state and mutable data, changes made by programs that are preempted have to be rolled back, and the work done by the preempted programs has to be discarded. Hence in the P-FRP model, a preempted lower priority task will have to restart after higher priority tasks have completed execution. Current real-time research mainly focuses on the classic preemptive or non-preemptive models and plenty methods have been developed to analyze the real-time guarantees of these models. Unfortunately, due to its transactional nature where preempted tasks are aborted and have to restart, the execution semantics of the P-FRP model does not fit into the standard definitions of classic preemptive or non-preemptive execution. In this survey paper, we review existing researches on the P-FRP task scheduling, and present a few research areas for future work.","PeriodicalId":187873,"journal":{"name":"2016 1st CPSWeek Workshop on Declarative Cyber-Physical Systems (DCPS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127541042","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：