English
Related papers

Related papers: Hyper parametric timed CTL

200 papers

Hyperproperties are properties that refer to multiple computation traces. This includes many information-flow security policies, such as observational determinism, (generalized) noninterference, and noninference, and other system properties…

Logic in Computer Science · Computer Science 2019-03-28 Bernd Finkbeiner , Christopher Hahn , Tobias Hans

A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets…

Logic in Computer Science · Computer Science 2020-04-28 Martin Lück

Characterisations theorems serve as important tools in model theory and can be used to assess and compare the expressive power of temporal languages used for the specification and verification of properties in formal methods. While complete…

Logic in Computer Science · Computer Science 2024-04-30 Massimo Benerecetti , Laura Bozzelli , Fabio Mogavero , Adriano Peron

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

Hyperproperties express the relationship between multiple executions of a system. This is needed in many AI-related fields, such as knowledge representation and planning, to capture system properties related to knowledge, information flow,…

Logic in Computer Science · Computer Science 2024-04-16 Raven Beutner , Bernd Finkbeiner , Hadar Frenkel , Niklas Metzger

Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this task was recently shown to be in NC. In this paper, we present…

Logic in Computer Science · Computer Science 2014-04-29 Daniel Bundala , Joël Ouaknine

We consider the problem of automatically inferring specifications in the branching-time logic, Computation Tree Logic (CTL), from a given system. Designing functional and usable specifications has always been one of the biggest challenges…

Logic in Computer Science · Computer Science 2023-10-24 Rajarshi Roy , Daniel Neider

Cyber-physical systems often encompass complex concurrent behavior with timing constraints and probabilistic failures on demand. The analysis whether such systems with probabilistic timed behavior ad-here to a given specification is…

Software Engineering · Computer Science 2021-06-17 Sven Schneider , Maria Maximova , Holger Giese

We introduce a new class of automata on infinite trees called \emph{alternating nonzero automata}, which extends the class of non-deterministic nonzero automata. We reduce the emptiness problem for alternating nonzero automata to the same…

Logic in Computer Science · Computer Science 2018-02-13 Paulin Fournier , Hugo Gimbert

Metric Temporal Logic $\mathsf{MTL}[\until_I,\since_I]$ is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of…

Logic in Computer Science · Computer Science 2014-04-29 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya

Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even…

Formal Languages and Automata Theory · Computer Science 2016-08-08 Nikola Beneš , Peter Bezděk , Kim G. Larsen , Jiří Srba

A hyperproperty relates executions of a program and is used to formalize security objectives such as confidentiality, non-interference, privacy, and anonymity. Formally, a hyperproperty is a collection of allowable sets of executions. A…

Logic in Computer Science · Computer Science 2023-01-30 Ali Bajwa , Minjian Zhang , Rohit Chadha , Mahesh Viswanathan

We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing…

Logic in Computer Science · Computer Science 2018-07-02 Jan Křetínský , Alexej Rotar

We study model checking algorithms for infinite families of finite-state labeled transition systems against temporal properties written in CTL*. Such families arise, for example, as models of highly configurable systems or software product…

Logic in Computer Science · Computer Science 2026-01-23 Roberto Pettinau , Christoph Matheja

We introduce a novel logic for the specification of context-free hyperproperties, which capture, e.g., the flow of information in security-critical recursive systems. Intuitively, the logic extends visibly pushdown automata by…

Logic in Computer Science · Computer Science 2026-05-07 Sarah Winter , Martin Zimmermann

Propositional Projection Temporal Logic (PPTL) is a useful formalism for reasoning about period of time in hardware and software systems and can handle both sequential and parallel compositions. In this paper, based on discrete time Markov…

Logic in Computer Science · Computer Science 2010-11-08 Xiaoxiao Yang

We investigate the problem of controller synthesis for hyperproperties specified in the temporal logic HyperLTL. Hyperproperties are system properties that relate multiple execution traces. Hyperproperties can elegantly express…

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

Signal Temporal Logic (STL) specifications play a crucial role in defining complex temporal properties and behaviors in safety-critical cyber-physical systems (CPS). However, fault diagnosis (FD) and fault-tolerant control (FTC) for CPS…

Systems and Control · Electrical Eng. & Systems 2025-03-11 Penghong Lu , Gang Chen , Rong Su

Hyperproperties, as introduced by Clarkson and Schneider, characterize the correctness of a computer program as a condition on its set of computation paths. Standard temporal logics can only refer to a single path at a time, and therefore…

Logic in Computer Science · Computer Science 2013-07-01 Bernd Finkbeiner , Markus N. Rabe , César Sánchez

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
‹ Prev 1 3 4 5 6 7 10 Next ›