English
Related papers

Related papers: Sampling Polynomial Trajectories for LTL Verificat…

200 papers

This paper studies the structure of several real-world traces (including Facebook, High-Performance Computing, Machine Learning, and simulation generated traces) and presents a systematic approach to quantify and compare the structure of…

Networking and Internet Architecture · Computer Science 2019-05-22 Chen Avin , Manya Ghobadi , Chen Griner , Stefan Schmid

This paper presents a new approach to design verified compositions of Neural Network (NN) controllers for autonomous systems with tasks captured by Linear Temporal Logic (LTL) formulas. Particularly, the LTL formula requires the system to…

Robotics · Computer Science 2022-09-14 Jun Wang , Samarth Kalluraya , Yiannis Kantaros

This paper revisits the classical notion of sampling in the setting of real-time temporal logics for the modeling and analysis of systems. The relationship between the satisfiability of Metric Temporal Logic (MTL) formulas over…

Logic in Computer Science · Computer Science 2015-03-13 Carlo A. Furia , Matteo Rossi

Verifying quantum systems has attracted a lot of interests in the last decades. In this paper, we initialised the model checking of quantum continuous-time Markov chain (QCTMC). As a real-time system, we specify the temporal properties on…

Quantum Physics · Physics 2024-02-27 Ming Xu , Jingyi Mei , Ji Guan , Nengkun Yu

We study the problem of learning a mixture of multiple linear dynamical systems (LDSs) from unlabeled short sample trajectories, each generated by one of the LDS models. Despite the wide applicability of mixture models for time-series data,…

Machine Learning · Statistics 2022-05-26 Yanxi Chen , H. Vincent Poor

We classify the complexity of the LTL satisfiability and model checking problems for several standard parameterisations. The investigated parameters are temporal depth, number of propositional variables and formula treewidth, resp.,…

Logic in Computer Science · Computer Science 2015-09-23 Martin Lück , Arne Meier

Although recent tool-augmented benchmarks involve complex requests, evaluation remains limited to answer matching, neglecting critical trajectory aspects like efficiency, hallucination, and adaptivity. The most straightforward method for…

Artificial Intelligence · Computer Science 2026-05-26 Wonjoong Kim , Sangwu Park , Yeonjun In , Sein Kim , Dongha Lee , Chanyoung Park

Pedestrian trajectory prediction is a critical to avoid autonomous driving collision. But this prediction is a challenging problem due to social forces and cluttered scenes. Such human-human and human-space interactions lead to many…

Computer Vision and Pattern Recognition · Computer Science 2020-09-24 Xiong Dan

This paper investigates continuous-time motion planning under Signal Temporal Logic (STL) specifications. The goal is to generate smooth robot trajectories that satisfy high-level logical and timing requirements while respecting low-level…

Robotics · Computer Science 2026-05-25 Yu Chen , Ancheng Hou , Mingyang Feng , Xiao Yu , Xiang Yin

The reliable execution of high-level missions in multi-robot systems with heterogeneous agents, requires robust methods for detecting spurious behaviors. In this paper, we address the challenge of identifying spurious executions of plans…

Robotics · Computer Science 2026-04-23 Fernando Salanova , Jesús Roche , Cristian Mahulea , Eduardo Montijano

In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such attempts used polynomial-time transformation which is a…

Computational Complexity · Computer Science 2023-02-20 Malay Dutta , Anjana K. Mahanta

Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e.,…

Logic in Computer Science · Computer Science 2023-06-22 David Baelde , Stéphanie Delaune , Lucca Hirschi

Girard's Light linear logic (LLL) characterized polynomial time in the proof-as-program paradigm with a bound on cut elimination. This logic relied on a stratification principle and a "one-door" principle which were generalized later…

Logic in Computer Science · Computer Science 2014-05-20 Matthieu Perrinel

Modern complex software systems produce a large amount of execution data, often stored in logs. These logs can be analyzed using trace checking techniques to check whether the system complies with its requirements specifications. Often…

Software Engineering · Computer Science 2014-06-17 Domenico Bianculli , Carlo Ghezzi , Srdan Krstic

Virtually all verification and synthesis techniques assume that the formal specifications are readily available, functionally correct, and fully match the engineer's understanding of the given system. However, this assumption is often…

Formal Languages and Automata Theory · Computer Science 2022-06-15 Simon Lutz , Daniel Neider , Rajarshi Roy

Most current methods for learning from demonstrations assume that those demonstrations alone are sufficient to learn the underlying task. This is often untrue, especially if extra safety specifications exist which were not present in the…

Machine Learning · Computer Science 2020-05-26 Craig Innes , Subramanian Ramamoorthy

This paper describes a technique for inferring temporal-logic properties for sets of finite data streams. Such data streams arise in many domains, including server logs, program testing, and financial and marketing data; temporal-logic…

Logic in Computer Science · Computer Science 2020-06-09 Samuel Huang , Rance Cleaveland

Signal Temporal Logic (STL) has gained popularity in recent years as a specification language for cyber-physical systems, especially in robotics. Beyond being expressive and easy to understand, STL is appealing because the synthesis…

Robotics · Computer Science 2020-11-17 Vince Kurtz , Hai Lin

The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to…

Databases · Computer Science 2024-03-29 Philipp Hanisch , Markus Krötzsch

In this paper we present a novel rule-based approach for Runtime Verification of FLTL properties over finite but expanding traces. Our system exploits Horn clauses in implication form and relies on a forward chaining-based monitoring…

Logic in Computer Science · Computer Science 2014-12-04 Alan Perotti , Guido Boella , Artur d'Avila Garcez