English
Related papers

Related papers: Model-Checking of Linear-Time Properties Based on …

200 papers

Human drivers naturally balance the risks of different concerns while driving, including traffic rule violations, minor accidents, and fatalities. However, achieving the same behavior in autonomous driving systems remains an open problem.…

Systems and Control · Electrical Eng. & Systems 2026-03-06 Shuhao Qi , Zengjie Zhang , Zhiyong Sun , Sofie Haesaert

Many important properties of cyber-physical systems (CPS) are defined upon the relationship between multiple executions simultaneously in continuous time. Examples include probabilistic fairness and sensitivity to modeling errors (i.e.,…

Logic in Computer Science · Computer Science 2019-08-07 Yu Wang , Mojtaba Zarei , Borzoo Bonakdarpour , Miroslav Pajic

Mechanized verification of liveness properties for infinite programs with effects and nondeterminism is challenging. Existing temporal reasoning frameworks operate at the level of models such as traces and automata. Reasoning happens at a…

Programming Languages · Computer Science 2025-08-22 Eleftherios Ioannidis , Yannick Zakowski , Steve Zdancewic , Sebastian Angel

It is important to find optimal solutions for structural errors in rule-based expert systems .Solutions to discovering such errors by using model checking techniques have already been proposed, but these solutions have problems such as…

Artificial Intelligence · Computer Science 2014-04-11 Einollah pira , Mohammad Reza Zand Miralvand , Fakhteh Soltani

This paper concerns branching simulation for weighted Kripke structures with parametric weights. Concretely, we consider a weighted extension of branching simulation where a single transitions can be matched by a sequence of transitions…

Logic in Computer Science · Computer Science 2016-08-03 Louise Foshammer , Kim Guldstrand Larsen , Anders Mariegaard

This paper focuses on synthesizing control policies for discrete-time stochastic control systems together with a lower bound on the probability that the systems satisfy the complex temporal properties. The desired properties of the system…

Systems and Control · Electrical Eng. & Systems 2020-08-07 Pushpak Jagtap , Sadegh Soudjani , Majid Zamani

Probabilistic timed automata (PTAs) are timed automata (TAs) extended with discrete probability distributions.They serve as a mathematical model for a wide range of applications that involve both stochastic and timed behaviours. In this…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Hongfei Fu , Yi Li , Jianlin Li , Lijun Zhang

We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…

Probability · Mathematics 2015-01-20 Raphael Lachieze-Rey , Ilya Molchanov

We study the problem of formalizing and checking probabilistic hyperproperties for models that allow nondeterminism in actions. We extend the temporal logic \HyperPCTL, which has been previously introduced for discrete-time Markov chains,…

Logic in Computer Science · Computer Science 2020-07-17 Erika Abraham , Ezio Bartocci , Borzoo Bonakdarpour , Oyendrila Dobe

Hyperproperties are properties of systems that relate different executions traces, with many applications from security to symmetry, consistency models of concurrency, etc. In recent years, different linear-time logics for specifying…

Logic in Computer Science · Computer Science 2022-07-08 Laura Bozzelli , Adriano Peron , Cesar Sanchez

Hyperproperties are properties of sets of computation traces. In this paper, we study quantitative hyperproperties, which we define as hyperproperties that express a bound on the number of traces that may appear in a certain relation. For…

Logic in Computer Science · Computer Science 2019-06-03 Bernd Finkbeiner , Christopher Hahn , Hazem Torfah

Probabilistic model checking can provide formal guarantees on the behavior of stochastic models relating to a wide range of quantitative properties, such as runtime, energy consumption or cost. But decision making is typically with respect…

Logic in Computer Science · Computer Science 2024-03-19 Ingy Elsayed-Aly , David Parker , Lu Feng

Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference…

Systems and Control · Computer Science 2016-05-13 Matthias Lorenzen , Fabrizio Dabbene , Roberto Tempo , Frank Allgöwer

In this paper, we introduce a hybrid zonotope-based approach for formally verifying the behavior of autonomous systems operating under Linear Temporal Logic (LTL) specifications. In particular, we formally verify the LTL formula by…

Systems and Control · Electrical Eng. & Systems 2024-05-01 Loizos Hadjiloizou , Frank J. Jiang , Amr Alanwar , Karl H. Johansson

Probabilistic model checking has been developed for verifying systems that have stochastic and nondeterministic behavior. Given a probabilistic system, a probabilistic model checker takes a property and checks whether or not the property…

Machine Learning · Computer Science 2022-01-11 Wen-Chi Yang , Jean-François Raskin , Luc De Raedt

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also…

Logic in Computer Science · Computer Science 2017-01-11 Joel Ouaknine , James Worrell

We develop a linear systems theory that coincides with the existing theories for continuous and discrete dynamical systems, but that also extends to linear systems defined on nonuniform time domains. The approach here is based on…

Optimization and Control · Mathematics 2009-03-03 John M. Davis , Ian A. Gravagne , Billy J. Jackson , Robert J. Marks

One of the advantages of adopting a Model Based Development (MBD) process is that it enables testing and verification at early stages of development. However, it is often desirable to not only verify/falsify certain formal system…

Logic in Computer Science · Computer Science 2017-02-07 Bardh Hoxha , Adel Dokhanchi , Georgios Fainekos

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

Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these transformations are inherently imprecise. That is, for some instances, the temporal property…

Logic in Computer Science · Computer Science 2021-06-03 Oded Padon , Jochen Hoenicke , Kenneth L. McMillan , Andreas Podelski , Mooly Sagiv , Sharon Shoham