English
Related papers

Related papers: Model Checking for a Class of Weighted Automata

200 papers

The integrated conditional moment (ICM) test is a classical and widely used method for assessing the adequacy of regression models. Although it performs well in fixed-dimension settings, its behavior changes dramatically when the predictor…

Methodology · Statistics 2026-04-17 Yue Hu , Haiqi Li , Xintao Xia

Existing procedures for model validation have been deemed inadequate for many engineering systems. The reason of this inadequacy is due to the high degree of complexity of the mechanisms that govern these systems. It is proposed in this…

Artificial Intelligence · Computer Science 2007-05-23 A. Guergachi

We show how machine-learning techniques, particularly neural networks, offer a very effective and highly efficient solution to the approximate model-checking problem for continuous and hybrid systems, a solution where the general-purpose…

Machine Learning · Computer Science 2017-12-07 Dung Phan , Radu Grosu , Nicola Paoletti , Scott A. Smolka , Scott D. Stoller

We introduce a method to verify stochastic reinforcement learning (RL) policies. This approach is compatible with any RL algorithm as long as the algorithm and its corresponding environment collectively adhere to the Markov property. In…

Artificial Intelligence · Computer Science 2024-03-28 Dennis Gross , Helge Spieker

The problem of predicting the training time of machine learning (ML) models has become extremely relevant in the scientific community. Being able to predict a priori the training time of an ML model would enable the automatic selection of…

Machine Learning · Computer Science 2023-09-21 Francesca Marzi , Giordano d'Aloisio , Antinisca Di Marco , Giovanni Stilo

We study the model-checking problem for a quantitative extension of the modal mu-calculus on a class of hybrid systems. Qualitative model checking has been proved decidable and implemented for several classes of systems, but this is not the…

Logic in Computer Science · Computer Science 2015-07-01 Diana Fischer , Lukasz Kaiser

Fault-tolerant distributed algorithms are central for building reliable spatially distributed systems. Unfortunately, the lack of a canonical precise framework for fault-tolerant algorithms is an obstacle for both verification and…

Formal Languages and Automata Theory · Computer Science 2012-10-16 Annu John , Igor Konnov , Ulrich Schmid , Helmut Veith , Josef Widder

Temporal Logic Model Checking is a verification method in which we describe a system, the model, and then we verify whether some properties, expressed in a temporal logic formula, hold in the system. It has many industrial applications. In…

Artificial Intelligence · Computer Science 2021-04-12 Paolo Liberatore , Marco Schaerf

While vehicles have primarily been controlled through mechanical means in years past, an increasing number of embedded control systems are being installed and used, keeping pace with advances in electronic control technology and…

We examine different generalizations of checking stack automata by allowing multiple input heads and multiple stacks, and characterize their computing power in terms of two-way multi-head finite automata and space-bounded Turing machines.…

Formal Languages and Automata Theory · Computer Science 2022-12-05 Oscar H. Ibarra , Ian McQuillan

The choice of model class is fundamental in statistical learning and system identification, no matter whether the class is derived from physical principles or is a generic black-box. We develop a method to evaluate the specified model class…

Machine Learning · Statistics 2017-12-20 Andreas Svensson , Dave Zachariah , Thomas B. Schön

We introduce a framework for analyzing ordinary differential equation (ODE) models of biological networks using statistical model checking (SMC). A key aspect of our work is the modeling of single-cell variability by assigning a probability…

Quantitative Methods · Quantitative Biology 2018-12-05 Bing Liu , Benjamin M. Gyori , P. S. Thiagarajan

We consider quantitative extensions of the alternating-time temporal logics ATL/ATLs called quantitative alternating-time temporal logics (QATL/QATLs) in which the value of a counter can be compared to constants using equality, inequality…

Logic in Computer Science · Computer Science 2014-09-22 Steen Vester

When a number of similar tasks have to be learned simultaneously, multi-task learning (MTL) models can attain significantly higher accuracy than single-task learning (STL) models. However, the advantage of MTL depends on various factors,…

Machine Learning · Computer Science 2023-10-26 Afiya Ayman , Ayan Mukhopadhyay , Aron Laszka

We study statistical model checking of continuous-time stochastic hybrid systems. The challenge in applying statistical model checking to these systems is that one cannot simulate such systems exactly. We employ the multilevel Monte Carlo…

Systems and Control · Computer Science 2017-06-27 Sadegh Esmaeil Zadeh Soudjani , Rupak Majumdar , Tigran Nagapetyan

Within a component-based approach allowing dynamic reconfigurations, sequences of successive reconfiguration operations are expressed by means of reconfiguration paths, possibly infinite. We show that a subclass of such paths can be…

Software Engineering · Computer Science 2015-03-18 Jean-Michel Hufflen

We report on COOL-MC, a model checking tool for fixpoint logics that is parametric in the branching type of models (nondeterministic, game-based, probabilistic etc.) and in the next-step modalities used in formulae. The tool implements…

Logic in Computer Science · Computer Science 2023-11-06 Daniel Hausmann , Merlin Humml , Simon Prucker , Lutz Schröder , Aaron Strahlberger

In this paper we demonstrate an approach to model structure and behavior of distributed systems, to map those models to a lightweight execution engine by using a functional programming language and to systematically define and execute tests…

Software Engineering · Computer Science 2014-09-24 Borislav Gajanovic , Hans Grönninger , Bernhard Rumpe

We define extensions of CTL and TCTL with strategic operators, called Strategic CTL (SCTL) and Strategic TCTL (STCTL), respectively. For each of the above logics we give a synchronous and asynchronous semantics, i.e., STCTL is interpreted…

Logic in Computer Science · Computer Science 2023-10-20 Jaime Arias , Wojciech Jamroga , Wojciech Penczek , Laure Petrucci , Teofil Sidoruk

Model checking is usually based on a comprehensive traversal of the state space. Causality-based model checking is a radically different approach that instead analyzes the cause-effect relationships in a program. We give an overview on a…

Logic in Computer Science · Computer Science 2017-10-11 Bernd Finkbeiner , Andrey Kupriyanov