English
Related papers

Related papers: Hyper parametric timed CTL

200 papers

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) extend Linear Temporal Logic (LTL) for real-time constraints, with MTL using time-bounded modalities and TPTL employing freeze quantifiers. Satisfiability for both is…

Logic in Computer Science · Computer Science 2024-11-04 Shankara Narayanan Krishna , Khushraj Madnani , Agnipratim Nag , Paritosh Pandya

We present RVHyper, a runtime verification tool for hyperproperties. Hyperproperties, such as non-interference and observational determinism, relate multiple computation traces with each other. Specifications are given as formulas in the…

Logic in Computer Science · Computer Science 2019-06-04 Bernd Finkbeiner , Christopher Hahn , Marvin Stenger , Leander Tentrup

We introduce and investigate a powerful hyper logical framework in the linear-time setting, we call generalized HyperLTL with stuttering and contexts (GHyperLTL_SC for short). GHyperLTL_SC unifies known asynchronous extensions of HyperLTL…

Logic in Computer Science · Computer Science 2024-10-03 Alberto Bombardelli , Laura Bozzelli , César Sánchez , Stefano Tonetta

The problem of checking a logged event trace against a temporal logic specification arises in many practical cases. Unfortunately, known algorithms for an expressive logic like MTL (Metric Temporal Logic) do not scale with respect to two…

Software Engineering · Computer Science 2015-08-27 Marcello M. Bersani , Domenico Bianculli , Carlo Ghezzi , Srdan Krstic , Pierluigi San Pietro

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…

Logic in Computer Science · Computer Science 2024-05-31 Luca Geatti , Alessandro Gianola , Nicola Gigante

We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT-LTL, which extends LTL by temporal operators equipped with parameters that bound their scope. For single process…

Logic in Computer Science · Computer Science 2018-02-28 Swen Jacobs , Leander Tentrup , Martin Zimmermann

Ensuring the correctness of critical real-time systems, involving concurrent behaviours and timing requirements, is crucial. Timed automata extend finite-state automata with clocks, compared in guards and invariants with integer constants.…

Logic in Computer Science · Computer Science 2026-05-06 Étienne André , Didier Lime , Olivier H. Roux

Parametric analysis is a powerful tool for designing modern embedded systems, because it permits to explore the space of design parameters, and to check the robustness of the system with respect to variations of some uncontrollable…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-07 Youcheng Sun , Romain Soulat , Giuseppe Lipari , Étienne André , Laurent Fribourg

We consider the setting of stochastic multiagent systems modelled as stochastic multiplayer games and formulate an automated verification framework for quantifying and reasoning about agents' trust. To capture human trust, we work with a…

Logic in Computer Science · Computer Science 2019-05-17 Xiaowei Huang , Marta Kwiatkowska , Maciej Olejnik

Runtime verification is an effective automated method for specification-based offline testing and analysis as well as online monitoring of complex systems. The specification language is often a variant of regular expressions or a popular…

Logic in Computer Science · Computer Science 2014-11-11 Ramy Medhat , Yogi Joshi , Borzoo Bonakdarpour , Sebastian Fischmeister

Temporal hyperproperties are system properties that relate multiple execution traces. For (finite-state) hardware, temporal hyperproperties are supported by model checking algorithms, and tools for general temporal logics like HyperLTL…

Logic in Computer Science · Computer Science 2022-08-26 Raven Beutner , Bernd Finkbeiner

We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interval Markov Chains. In this context, we consider the…

Formal Languages and Automata Theory · Computer Science 2019-06-13 Étienne André , Benoît Delahaye , Paulin Fournier

Temporal logics for hyperproperties like HyperLTL use trace quantifiers to express properties that relate multiple system runs. In practice, the verification of such specifications is mostly limited to formulas without quantifier…

Logic in Computer Science · Computer Science 2022-06-07 Raven Beutner , Bernd Finkbeiner

An enforcement mechanism monitors a reactive system for undesired behavior at runtime and corrects the system's output in case it violates the given specification. In this paper, we study the enforcement problem for hyperproperties, i.e.,…

Logic in Computer Science · Computer Science 2022-03-09 Norine Coenen , Bernd Finkbeiner , Christopher Hahn , Jana Hofmann , Yannick Schillo

In areas such as computer software and hardware, manufacturing systems, and transportation, engineers encounter networks with arbitrarily large numbers of isomorphic subprocesses. Parameterized systems provide a framework for modeling such…

Formal Languages and Automata Theory · Computer Science 2016-10-03 M. H. Zibaeenejad , J. G. Thistle

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of…

Logic in Computer Science · Computer Science 2019-11-19 Fabrizio M. Maggi , Marco Montali , Rafael Peñaloza

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis…

Formal Languages and Automata Theory · Computer Science 2016-03-07 Peter Bezděk , Nikola Beneš , Jiří Barnat , Ivana Černá

It has gained broad attention to understand the timed distributed trace of a cyber-physical system at runtime, which is often achieved by verifying properties over the observed trace of system execution. However, this verification is facing…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-08-04 Yiling Yang , Yu Huang , Jiannong Cao , Jian Lu

We study the runtime verification of hyperproperties, expressed in the temporal logic HyperLTL, as a means to inspect a system with respect to security polices. Runtime monitors for hyperproperties analyze trace logs that are organized by…

Logic in Computer Science · Computer Science 2021-01-21 Borzoo Bonakdarpour , Bernd Finkbeiner

Hypertrace logic is a sorted first-order logic with separate sorts for time and execution traces. Its formulas specify hyperproperties, which are properties relating multiple traces. In this work, we extend hypertrace logic by introducing…

Logic in Computer Science · Computer Science 2025-10-15 Marek Chalupa , Thomas A. Henzinger , Ana Oliveira da Costa