English
Related papers

Related papers: Temporal Hyperproperties for Population Protocols

200 papers

Population protocols are a well-studied model of distributed computation in which a group of anonymous finite-state agents communicates via pairwise interactions. Together they decide whether their initial configuration, that is, the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-03 Steffen van Bergerem , Roland Guttenberg , Sandra Kiefer , Corto Mascle , Nicolas Waldburger , Chana Weil-Kennedy

A new logic for verification of security policies is proposed. The logic, HyperLTL, extends linear-time temporal logic (LTL) with connectives for explicit and simultaneous quantification over multiple execution paths, thereby enabling…

Logic in Computer Science · Computer Science 2013-07-10 Masoud Koleini , Michael R. Clarkson , Kristopher K. Micinski

Non-deterministic planning aims to find a policy that achieves a given objective in an environment where actions have uncertain effects, and the agent - potentially - only observes parts of the current state. Hyperproperties are properties…

Logic in Computer Science · Computer Science 2024-05-24 Raven Beutner , Bernd Finkbeiner

Hyperproperties are commonly used in computer security to define information-flow policies and other requirements that reason about the relationship between multiple computations. In this paper, we study a novel class of hyperproperties…

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

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

Population protocols are a distributed computation model in which a collection of anonymous, finite-state agents interact in randomly chosen pairs and update their states according to a fixed transition function. The computation is defined…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-12 Michael Blondin , Michaël Cadilhac , Benjamin Courchesne , Lucie Guillou , Corto Mascle , Isa Vialard

Population protocols [Angluin et al., PODC, 2004] are a model of distributed computation in which indistinguishable, finite-state agents interact in pairs to decide if their initial configuration, i.e., the initial number of agents in each…

Logic in Computer Science · Computer Science 2021-02-10 Javier Esparza , Stefan Jaax , Mikhail Raskin , Chana Weil-Kennedy

A population protocol describes a set of state change rules for a population of $n$ indistinguishable finite-state agents (automata), undergoing random pairwise interactions. Within this very basic framework, it is possible to resolve a…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-04-19 Adrian Kosowski , Przemysław Uznański

Many important cryptographic primitives offer probabilistic guarantees of security that can be specified as quantitative hyperproperties; these are specifications that stipulate the existence of a certain number of traces in the system…

Cryptography and Security · Computer Science 2020-05-18 Shubham Sahai , Rohit Sinha , Pramod Subramanyan

System requirements related to concepts like information flow, knowledge, and robustness cannot be judged in terms of individual system executions, but rather require an analysis of the relationship between multiple executions. Such…

Logic in Computer Science · Computer Science 2025-01-15 Bernd Finkbeiner

Population protocols are a relatively novel computational model in which very resource-limited anonymous agents interact in pairs with the goal of computing predicates. We consider the probabilistic version of this model, which naturally…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Vladyslav Melnychuk

Population protocols are a model of distributed computation intended for the study of networks of independent computing agents with dynamic communication structure. Each agent has a finite number of states, and communication opportunities…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-12-28 Mikhail Raskin

Max-Plus Linear (MPL) systems are an algebraic formalism with practical applications in transportation networks, manufacturing and biological systems. In this paper, we investigate the problem of automatically analyzing the properties of…

Formal Languages and Automata Theory · Computer Science 2023-08-22 Muhammad Syifa'ul Mufid , Andrea Micheli , Alessandro Abate , Alessandro Cimatti

Hyperparameter selection is a critical step in the deployment of artificial intelligence (AI) models, particularly in the current era of foundational, pre-trained, models. By framing hyperparameter selection as a multiple hypothesis testing…

Machine Learning · Computer Science 2025-02-07 Amirmohammad Farzaneh , Osvaldo Simeone

Population protocols form a well-established model of computation of passively mobile anonymous agents with constant-size memory. It is well known that population protocols compute Presburger-definable predicates, such as absolute majority…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-07-06 Michael Blondin , François Ladouceur

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

We present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team semantics, LTL is able to express hyperproperties, which have…

Logic in Computer Science · Computer Science 2025-10-14 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann

We present a novel asynchronous hyper linear time temporal logic named LPrL (Linear Time Predicate Logic) and establish its basic theory. LPrL is a natural first order extension of LTL (Linear time temporal logic), in which the predicates…

Logic in Computer Science · Computer Science 2026-01-22 Parasara Sridhar Duggirala , P. S. Thiagarajan

Population protocols are a model of distributed computation intended for the study of networks of independent computing agents with dynamic communication structure. Each agent has a finite number of states, and communication opportunities…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-09-02 Michael Raskin

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