English
Related papers

Related papers: HyLTL: a temporal logic for model checking hybrid …

200 papers

Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SAT or SMT solver. MITL is a real-time extension of the linear…

Logic in Computer Science · Computer Science 2013-04-29 Roland Kindermann , Tommi Junttila , Ilkka Niemelä

The translation of Metric Interval Temporal Logic (MITL) to timed automata is a topic that has been extensively studied. A key challenge here is the conversion of future modalities into equivalent automata. Typical conversions equip the…

Formal Languages and Automata Theory · Computer Science 2025-07-08 S. Akshay , Paul Gastin , R. Govind , B. Srivathsan

Hybrid systems exhibit both continuous and discrete behavior. Analyzing hybrid systems is known to be hard. Inspired by the idea of concolic testing (of programs), we investigate whether we can combine random sampling and symbolic execution…

Software Engineering · Computer Science 2016-09-01 Pingfan Kong , Yi Li , Xiaohong Chen , Jun Sun , Meng Sun , Jingyi Wang

Hybrid systems with both discrete and continuous dynamics are an important model for real-world cyber-physical systems. The key challenge is to ensure their correct functioning w.r.t. safety requirements. Promising techniques to ensure…

Logic in Computer Science · Computer Science 2015-05-27 Stefan Mitsch , Grant Olney Passmore , Andre Platzer

We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for generalized HyperLTL with stuttering and contexts, an expressive logic for the specification of asynchronous hyperproperties. Such properties…

Logic in Computer Science · Computer Science 2025-11-11 Gaëtan Regaud , Martin Zimmermann

This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational…

Logic in Computer Science · Computer Science 2011-04-29 Thomas Brihaye , Laurent Doyen , Gilles Geeraerts , Joël Ouaknine , Jean-François Raskin , James Worrell

There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have…

Programming Languages · Computer Science 2018-03-01 Naoki Kobayashi , Takeshi Tsukada , Keiichi Watanabe

Recently there has been a great attention from the scientific community towards the use of the model-checking technique as a tool for test generation in the simulation field. This paper aims to provide a useful mean to get more insights…

Logic in Computer Science · Computer Science 2011-11-14 Margherita Napoli , Mimmo Parente

This paper introduces operators, semantics, characterizations, and solution-independent conditions to guarantee temporal logic specifications for hybrid dynamical systems. Hybrid dynamical systems are given in terms of differential…

Systems and Control · Electrical Eng. & Systems 2020-06-17 Hyejin Han , Ricardo G. Sanfelice

Information systems increasingly leverage artificial intelligence (AI) and machine learning (ML) to generate value from vast amounts of data. However, ML models are imperfect and can generate incorrect classifications. Hence,…

Machine Learning · Computer Science 2023-07-10 Johannes Jakubik , Daniel Weber , Patrick Hemmer , Michael Vössing , Gerhard Satzger

Timed Automata (TA) are a very popular modeling formalism for systems with time-sensitive properties. A common task is to verify if a network of TA satisfies a given property, usually expressed in Linear Temporal Logic (LTL), or in a subset…

Logic in Computer Science · Computer Science 2021-04-27 Robert L. Smith , Marcello M. Bersani , Matteo Rossi , Pierluigi San Pietro

Freeze LTL is a temporal logic with registers that is suitable for specifying properties of data words. In this paper we study the model checking problem for Freeze LTL on one-counter automata. This problem is known to be undecidable in…

Logic in Computer Science · Computer Science 2023-06-22 Antonia Lechner , Richard Mayr , Joël Ouaknine , Amaury Pouly , James Worrell

In this paper, we present a mechanism for building hybrid system observers to differentiate between specific positions of the hybrid system. The mechanism is designed through inferring metric temporal logic (MTL) formulae from simulated…

Systems and Control · Electrical Eng. & Systems 2020-04-07 Zhe Xu , Yi Deng , Agung Julius

In current practice a formal analysis of hybrid system models is assertion-based. The work presented here is based on features that look beyond functional correctness toward a quantitative evaluation of behavioral attributes. A feature…

Logic in Computer Science · Computer Science 2019-02-25 Antonio Anastasio Bruto da Costa , Goran Frehse , Pallab Dasgupta

Reinforcement Learning (RL) based methods have been increasingly explored for robot learning. However, RL based methods often suffer from low sampling efficiency in the exploration phase, especially for long-horizon manipulation tasks, and…

Robotics · Computer Science 2024-12-31 Hao Zhang , Hao Wang , Xiucai Huang , Wenrui Chen , Zhen Kan

Model checking and automated theorem proving are two pillars of formal methods. This paper investigates model checking from an automated theorem proving perspective, aiming at combining the expressiveness of automated theorem proving and…

Logic in Computer Science · Computer Science 2017-10-03 Ying Jiang , Jian Liu , Gilles Dowek , Kailiang Ji

Model checking for real-timed systems is a rich and diverse topic. Among the different logics considered, Metric Interval Temporal Logic (MITL) is a powerful and commonly used logic, which can succinctly encode many interesting timed…

Formal Languages and Automata Theory · Computer Science 2026-05-19 S. Akshay , Prerak Contractor , Paul Gastin , R. Govind , B. Srivathsan

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

Metric Interval Temporal Logic (MITL) is a well studied real-time, temporal logic that has decidable satisfiability and model checking problems. The decision procedures for MITL rely on the automata theoretic approach, where logic formulas…

Logic in Computer Science · Computer Science 2019-10-11 Nima Roohi , Mahesh Viswanathan

We study the expressivity and complexity of model checking linear temporal logic with team semantics (TeamLTL). TeamLTL, despite being a purely modal logic, is capable of defining hyperproperties, i.e., properties which relate multiple…

Logic in Computer Science · Computer Science 2021-11-24 Jonni Virtema , Jana Hofmann , Bernd Finkbeiner , Juha Kontinen , Fan Yang