timed automata
Recently Published Documents


TOTAL DOCUMENTS

1121
(FIVE YEARS 155)

H-INDEX

43
(FIVE YEARS 3)

2021 ◽  
Author(s):  
Ilya Kovalenko ◽  
Efe Balta ◽  
Dawn Tilbury ◽  
Kira Barton

Due to the advancements in manufacturing system technology and the ever-increasing demand for personalized products, there is a growing desire to improve the flexibility of manufacturing systems. Multi-agent control is one strategy that has been proposed to address this challenge. The multi-agent control strategy relies on the decision making and cooperation of a number of intelligent software agents to control and coordinate various components on the shop floor. One of the most important agents for this control strategy is the product agent, which is the decision maker for a single part in the manufacturing system. To improve the flexibility and adaptability of the product agent and its control strategy, this work proposes a direct and active cooperation framework for the product agent. The directly and actively cooperating product agent can identify and actively negotiate scheduling constraints with other agents in the system. A new modeling formalism, based on priced timed automata, and an optimization-based decision making strategy are proposed as part of the framework. Two simulation case studies showcase how direct and active cooperation can be used to improve the flexibility and performance of manufacturing systems.


2021 ◽  
Author(s):  
Ilya Kovalenko ◽  
Efe Balta ◽  
Dawn Tilbury ◽  
Kira Barton

Due to the advancements in manufacturing system technology and the ever-increasing demand for personalized products, there is a growing desire to improve the flexibility of manufacturing systems. Multi-agent control is one strategy that has been proposed to address this challenge. The multi-agent control strategy relies on the decision making and cooperation of a number of intelligent software agents to control and coordinate various components on the shop floor. One of the most important agents for this control strategy is the product agent, which is the decision maker for a single part in the manufacturing system. To improve the flexibility and adaptability of the product agent and its control strategy, this work proposes a direct and active cooperation framework for the product agent. The directly and actively cooperating product agent can identify and actively negotiate scheduling constraints with other agents in the system. A new modeling formalism, based on priced timed automata, and an optimization-based decision making strategy are proposed as part of the framework. Two simulation case studies showcase how direct and active cooperation can be used to improve the flexibility and performance of manufacturing systems.


Author(s):  
Georgios Bouloukakis ◽  
Nikolaos Georgantas ◽  
Ajay Kattepur ◽  
Valerie Issarny

AbstractWith the emergence of the Internet of Things (IoT), application developers can rely on a variety of protocols and Application Programming Interfaces (APIs) to support data exchange between IoT devices. However, this may result in highly heterogeneous IoT interactions in terms of both functional and non-functional semantics. To map between heterogeneous functional semantics, middleware connectors can be utilized to interconnect IoT devices via bridging mechanisms. In this paper, we make use of the Data eXchange (DeX) connector model that enables interoperability among heterogeneous IoT devices. DeX interactions, including synchronous, asynchronous and streaming, rely on generic post and get primitives to represent IoT device behaviors with varying space/time coupling. Nevertheless, non-functional time semantics of IoT interactions such as data availability/validity, intermittent connectivity and application processing time, can severely affect response times and success rates of DeX interactions. We introduce timing parameters for time semantics to enhance the DeX API. The new DeX API enables the mapping of both functional and time semantics of DeX interactions. By precisely studying these timing parameters using timed automata models, we verify conditions for successful interactions with DeX connectors. Furthermore, we statistically analyze through simulations the effect of varying timing parameters to ensure higher probabilities of successful interactions. Simulation experiments are compared with experiments run on the DeX Mediators (DeXM) framework to evaluate the accuracy of the results. This work can provide application developers with precise design time information when setting these timing parameters in order to ensure accurate runtime behavior.


Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2954
Author(s):  
Meng Sun ◽  
Yuteng Lu ◽  
Yichun Feng ◽  
Qi Zhang ◽  
Shaoying Liu

The Nervos CKB (Common Knowledge Base) is a public permissionless blockchain designed for the Nervos ecosystem. The CKB consensus protocol is the key protocol of the Nervos CKB, which improves the limit of the consensus’s performance for Bitcoin. In this paper, we developed the formal model of the CKB consensus protocol using timed automata. Based on the model, we formally verified various important properties of the Nervos CKB to provide a sufficient trustworthiness assurance. Especially, the security of the Nervos CKB against the selfish mining attacks to the protocol was investigated.


2021 ◽  
Vol Volume 17, Issue 4 ◽  
Author(s):  
Jeremy Sproston

Clock-dependent probabilistic timed automata extend classical timed automata with discrete probabilistic choice, where the probabilities are allowed to depend on the exact values of the clocks. Previous work has shown that the quantitative reachability problem for clock-dependent probabilistic timed automata with at least three clocks is undecidable. In this paper, we consider the subclass of clock-dependent probabilistic timed automata that have one clock, that have clock dependencies described by affine functions, and that satisfy an initialisation condition requiring that, at some point between taking edges with non-trivial clock dependencies, the clock must have an integer value. We present an approach for solving in polynomial time quantitative and qualitative reachability problems of such one-clock initialised clock-dependent probabilistic timed automata. Our results are obtained by a transformation to interval Markov decision processes.


2021 ◽  
Vol 20 (5s) ◽  
pp. 1-26
Author(s):  
Jinghao Sun ◽  
Nan Guan ◽  
Rongxiao Shi ◽  
Guozhen Tan ◽  
Wang Yi

Research on modeling and analysis of real-time computing systems has been done in two areas, model checking and real-time scheduling theory. In model checking, an expressive modeling formalism such as timed automata (TA) is used to model complex systems, but the analysis is typically very expensive due to state-space explosion. In real-time scheduling theory, the analysis techniques are highly efficient, but the models are often restrictive. In this paper, we aim to exploit the possibility of applying efficient analysis techniques rooted in real-time scheduling theory to analysis of real-time task systems modeled by timed automata with tasks (TAT). More specifically, we develop efficient techniques to analyze the feasibility of TAT-based task models (i.e., whether all tasks can meet their deadlines on single-processor) using demand bound functions (DBF), a widely used workload abstraction in real-time scheduling theory. Our proposed analysis method has a pseudo-polynomial time complexity if the number of clocks used to model each task is bounded by a constant, which is much lower than the exponential complexity of the traditional model-checking based analysis approach (also assuming the number of clocks is bounded by a constant). We apply dynamic programming techniques to implement the DBF-based analysis framework, and propose state space pruning techniques to accelerate the analysis process. Experimental results show that our DBF-based method can analyze a TAT system with 50 tasks within a few minutes, which significantly outperforms the state-of-the-art TAT-based schedulability analysis tool TIMES.


2021 ◽  
Vol 20 (5s) ◽  
pp. 1-26
Author(s):  
Jie An ◽  
Bohua Zhan ◽  
Naijun Zhan ◽  
Miaomiao Zhang

We present an active learning algorithm named NRTALearning for nondeterministic real-time automata (NRTAs). Real-time automata (RTAs) are a subclass of timed automata with only one clock which resets at each transition. First, we prove the corresponding Myhill-Nerode theorem for real-time languages. Then we show that there exists a unique minimal deterministic real-time automaton (DRTA) recognizing a given real-time language, but the same does not hold for NRTAs. We thus define a special kind of NRTAs, named residual real-time automata (RRTAs), and prove that there exists a minimal RRTA to recognize any given real-time language. This transforms the learning problem of NRTAs to the learning problem of RRTAs. After describing the learning algorithm in detail, we prove its correctness and polynomial complexity. In addition, based on the corresponding Myhill-Nerode theorem, we extend the existing active learning algorithm NL* for nondeterministic finite automata to learn RRTAs. We evaluate and compare the two algorithms on two benchmarks consisting of randomly generated NRTAs and rational regular expressions. The results show that NRTALearning generally performs fewer membership queries and more equivalence queries than the extended NL* algorithm, and the learnt NRTAs have much fewer locations than the corresponding minimal DRTAs. We also conduct a case study using a model of scheduling of final testing of integrated circuits.


2021 ◽  
Vol 182 (1) ◽  
pp. 69-94
Author(s):  
Étienne André ◽  
Didier Lime ◽  
Mathias Ramparison ◽  
Mariëlle Stoelinga

Risk assessment of cyber-physical systems, such as power plants, connected devices and IT-infrastructures has always been challenging: safety (i. e., absence of unintentional failures) and security (i. e., no disruptions due to attackers) are conditions that must be guaranteed. One of the traditional tools used to consider these problems is attack trees, a tree-based formalism inspired by fault trees, a well-known formalism used in safety engineering. In this paper we define and implement the translation of attack-fault trees (AFTs) to a new extension of timed automata, called parametric weighted timed automata. This allows us to parameterize constants such as time and discrete costs in an AFT and then, using the model-checker IMITATOR, to compute the set of parameter values such that a successful attack is possible. Moreover, we add the possibility to define counter-measures. Using the different sets of parameter values computed, different attack and fault scenarios can be deduced depending on the budget, time or computation power of the attacker, providing helpful data to select the most efficient counter-measure.


Sign in / Sign up

Export Citation Format

Share Document