Results 41 to 50 of about 8,430 (314)
A Note on Fault Diagnosis Algorithms [PDF]
, 2009 In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) B\"uchi automata.
Cassez, Franck
core +4 more sources
A Reaction-Diffusion Heart Model for the Closed-Loop Evaluation of Heart-Pacemaker Interaction
IEEE Access, 2022 The purpose of this manuscript is to develop a reaction-diffusion heart model for closed-loop evaluation of heart-pacemaker interaction, and to provide a hardware setup for the implementation of the closed-loop system.
Niccolo Biasi +3 more
doaj +1 more source
Optimality and robustness in multi-robot path planning with temporal logic constraints [PDF]
, 2013 In this paper we present a method for automatically generating optimal robot paths satisfying high-level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system.
Belta, Calin +4 more
core +1 more source
Kleene Algebras and Semimodules for Energy Problems [PDF]
, 2013 With the purpose of unifying a number of approaches to energy problems found in the literature, we introduce generalized energy automata. These are finite automata whose edges are labeled with energy functions that define how energy levels evolve during ...
A. Degorre +22 more
core +5 more sources
Completeness of Lyapunov Abstraction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In this work, we continue our study on discrete abstractions of dynamical systems. To this end, we use a family of partitioning functions to generate an abstraction.
Rafael Wisniewski, Christoffer Sloth
doaj +1 more source
Modeling and Verification of Uncertain Cyber-Physical System Based on Decision Processes
Mathematics, 2023 Currently, there is uncertainty in the modeling techniques of cyber-physical systems (CPS) when faced with the multiple possibilities and distributions of complex system behavior.
Na Chen, Shengling Geng, Yongming Li
doaj +1 more source
Reducing Clocks in Timed Automata while Preserving Bisimulation
, 2014 Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible.
Arun-Kumar, S. +2 more
core +1 more source
A Composable Discrete-Time Cellular Automaton Formalism [PDF]
, 2008 Existing Cellular Automata formalisms do not consider heterogenous composition of models. Simulations that are grounded in a suitable modeling formalism offer unique benefits as compared with those that are developed using an adhoc combination of modeling concepts and implementation techniques. The emerging and extensive use of CA in simulating complex
Gary R Mayer, Hessam S Sarjoughian
openaire +1 more source
Timed Parity Games: Complexity and Robustness [PDF]
Logical Methods in Computer Science, 2011 We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose a time delay ...
Krishnendu Chatterjee +2 more
doaj +1 more source
Improving search order for reachability testing in timed automata [PDF]
, 2015 Standard algorithms for reachability analysis of timed automata are sensitive to the order in which the transitions of the automata are taken. To tackle this problem, we propose a ranking system and a waiting strategy. This paper discusses the reason why
Herbreteau, Frédéric, Tran, Thanh-Tung
core +3 more sources