English
Related papers

Related papers: Refinement Checking for Multirate Hybrid ZIA

200 papers

In this paper we give an overview of results on the analysis of parametric linear hybrid automata, and of systems of similar linear hybrid automata: We present possibilities of describing systems with a parametric (i.e. not explicitly…

Logic in Computer Science · Computer Science 2025-05-15 Viorica Sofronie-Stokkermans , Philipp Marohn

We consider systems composed of an unbounded number of uniformly designed linear hybrid automata, whose dynamic behavior is determined by their relation to neighboring systems. We present a class of such systems and a class of safety…

Logic in Computer Science · Computer Science 2016-01-08 Werner Damm , Matthias Horbach , Viorica Sofronie-Stokkermans

Partition refinement is a method for minimizing automata and transition systems of various types. Recently, a new partition refinement algorithm and associated tool CoPaR were developed that are generic in the transition type of the input…

Data Structures and Algorithms · Computer Science 2022-04-14 Fabian Birkmann , Hans-Peter Deifel , Stefan Milius

The increasing integration of renewable energy sources has introduced complex dynamic behavior in power systems that challenge the adequacy of traditional continuous-time modeling approaches. These developments call for modeling frameworks…

Systems and Control · Electrical Eng. & Systems 2026-01-19 B. G. Odunlami , M. Netto , Y. Susuki

Model-driven design of software for safety-critical applications often relies on mathematically grounded techniques such as the B method. Such techniques consist in the successive applications of refinements to derive a concrete…

Software Engineering · Computer Science 2009-07-14 David Deharbe , Bruno E. G. Gomes , Anamaria M. Moreira

We present a numerically tractable formulation for computing the optimal control of the class of hybrid dynamical systems whose trajectories are continuous. Our formulation, an extension of existing relaxed-control techniques for switched…

Optimization and Control · Mathematics 2016-05-26 Tyler Westenbroek , Humberto Gonzalez

This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational (i.e., automata-based) and descriptive (i.e., logic-based)…

Logic in Computer Science · Computer Science 2013-08-14 Carlo A. Furia , Matteo Pradella , Matteo Rossi

Model checking is an established technique to formally verify automation systems which are required to be trusted. However, for sufficiently complex systems model checking becomes computationally infeasible. On the other hand, testing,…

Software Engineering · Computer Science 2019-07-30 Igor Buzhinsky , Valeriy Vyatkin

There is a great diversity of formal models to understand the dynamics of transport and vehicular flow on a road. Many of these models are inspired by the dynamics of flows governed by partial differential equations. However, it is possible…

Logic in Computer Science · Computer Science 2021-03-30 Miguel Andres Velasquez , Carlos Ernesto Ramirez

Hybrid systems are characterized by the hybrid evolution of their state: A part of the state changes discretely, the other part changes continuously over time. Typically, modern control applications belong to this class of systems, where a…

Software Engineering · Computer Science 2011-11-09 Bernhard K. Aichernig , Reinhold Kainhofer

Achieving truly fluid interaction with robots with speech interfaces remains a hard problem, and the experience of current Human-Robot Interaction (HRI) remains laboured and frustrating. Some of the barriers to fluid interaction stem from a…

Robotics · Computer Science 2026-04-22 Carlos Baptista De Lima , Julian Hough , Frank Förster , Patrick Holthaus , Yongjun Zheng

Software fuzzing has become a cornerstone in automated vulnerability discovery, yet existing mutation strategies often lack semantic awareness, leading to redundant test cases and slow exploration of deep program states. In this work, I…

Cryptography and Security · Computer Science 2025-11-07 Shiyin Lin

We consider the stability and the input-output analysis problems of a class of large-scale hybrid systems composed of continuous dynamics coupled with discrete dynamics defined over finite alphabets, e.g., deterministic finite state…

Optimization and Control · Mathematics 2018-03-05 Murat Cubuktepe , Mohamadreza Ahmadi , Ufuk Topcu , Brandon Hencey

In this paper, we address the problem of local search for the falsification of hybrid automata with affine dynamics. Namely, if we are given a sequence of locations and a maximum simulation time, we return the trajectory that comes the…

Systems and Control · Computer Science 2015-03-19 Houssam Abbas , Georgios Fainekos

We introduce skipping refinement, a new notion of correctness for reasoning about optimized reactive systems. Reasoning about reactive systems using refinement involves defining an abstract, high-level specification system and a concrete,…

Logic in Computer Science · Computer Science 2015-02-11 Mitesh Jain , Panagiotis Manolios

With new advances in machine learning and in particular powerful learning libraries, we illustrate some of the new possibilities they enable in terms of nonlinear system identification. For a large class of hybrid systems, we explain how…

Optimization and Control · Mathematics 2019-12-02 Mattias Fält , Pontus Giselsson

The paper proposes a framework for the construction of solutions to a hybrid dynamical system that exhibit Zeno behavior. A new approach that enables solution to be prolonged after reaching its Zeno time is developed. It allows for a…

Dynamical Systems · Mathematics 2016-09-30 Sergey Dashkovskiy , Petro Feketa

This paper establishes a general framework for describing hybrid dynamical systems which is particularly suitable for numerical simulation. In this context, the data structures used to describe the sets and functions which comprise the…

chao-dyn · Physics 2008-02-03 Allen Back , John Guckenheimer , Mark Myers

To model real-world software systems, modelling paradigms should support a form of compositionality. In interface theory and model-based testing with inputs and outputs, conjunctive operators have been introduced: the behaviour allowed by…

Formal Languages and Automata Theory · Computer Science 2020-02-21 Ramon Janssen

Determinization of fuzzy finite automata is understood here as a procedure of their conversion into equivalent crisp-deterministic fuzzy automata, which can be viewed as being deterministic with possibly infinitely many states, but with…

Formal Languages and Automata Theory · Computer Science 2014-12-17 Ivana Micić , Zorana Jančić , Jelena Ignjatović , Miroslav Ćirić