35 Hits in 1.9 sec

A Logic for Hyperproperties in Multi-Agent Systems [article]

Raven Beutner, Bernd Finkbeiner
2022 arXiv   pre-print
In this paper, we study a novel class of hyperproperties where the individual computation paths are chosen by the strategic choices of a coalition of agents in a multi-agent system.  ...  Our logic can express strategic hyperproperties, such as that the scheduler in a concurrent system has a strategy to avoid information leakage.  ...  The resulting logic (first-order HyperLTL) does not reason about the strategic behavior in the multi-agent systems. Hyperproperties in Multi-agent Systems.  ... 
arXiv:2203.07283v1 fatcat:pchwcvgua5dlrjm3qu6vwvfahe

HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties [article]

Erika Abraham, Borzoo Bonakdarpour
2018 arXiv   pre-print
In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system.  ...  The standard temporal logics for probabilistic systems, i.e., PCTL and PCTL* can refer only to a single path at a time and, hence, cannot express many probabilistic hyperproperties of interest.  ...  Acknowledgments We thank Boris Köpf for his valuable insights on expressing QIF policies.  ... 
arXiv:1804.01853v1 fatcat:qpj2jormfvfpnhucsfmvop2saq

Probabilistic Hyperproperties of Markov Decision Processes [article]

Rayna Dimitrova and Bernd Finkbeiner and Hazem Torfah
2020 arXiv   pre-print
While the model checking problem for PHL is in general undecidable, we provide methods both for proving and for refuting formulas from a fragment of the logic.  ...  PHL can express a wide range of hyperproperties for probabilistic systems, including both classical applications, such as probabilistic noninterference, and novel applications in areas such as robotics  ...  For example, we can quantify the interference of the plans of different agents in a multi-agent system, such as the robots in a warehouse, or we can specify the existence of an approximately optimal policy  ... 
arXiv:2005.03362v3 fatcat:2v7if2v23zgjvmj5ccjmdt7k64

Specification Formalisms for Modern Cyber-Physical Systems (Dagstuhl Seminar 19071)

Jyotirmoy V. Deshmukh, Oded Maler, Dejan Nickovic, Michael Wagner
2019 Dagstuhl Reports  
Specifications play a major role in evaluating behaviors of modern cyber-physical systems (CPS).  ...  This report documents the program and the outcomes of Dagstuhl Seminar 19071 "Specification Formalisms for Modern Cyber-Physical Systems."  ...  Requirements for synthesis: Flexible mission specification and expressivity Multi-agent systems and interaction Multi-objective tasks Assumptions vs. guarantees in unstructured environments Requirements  ... 
doi:10.4230/dagrep.9.2.48 dblp:journals/dagstuhl-reports/DeshmukhMN19 fatcat:qs52xpqxbzh6vajciydqb3ujgi

Visual Analysis of Hyperproperties for Understanding Model Checking Results [article]

Tom Horak and Norine Coenen and Niklas Metzger and Christopher Hahn and Tamara Flemisch and Julián Méndez and Dennis Dimov and Bernd Finkbeiner and Raimund Dachselt
2021 arXiv   pre-print
Model checkers provide algorithms for proving that a mathematical model of a system satisfies a given specification.  ...  Understanding these counterexamples is challenging, especially for hyperproperty specifications, i.e., specifications that relate multiple executions of a system to each other.  ...  ACKNOWLEDGMENTS We thank Weizhou Luo for his valuable support during the overall project duration.  ... 
arXiv:2108.03698v1 fatcat:vfaxv6t4bnhhxpge22p4r6sg6a

Algorithms for Model Checking HyperLTL and HyperCTL $$^*$$ [chapter]

Bernd Finkbeiner, Markus N. Rabe, César Sánchez
2015 Lecture Notes in Computer Science  
We present an automata-based algorithm for checking finite state systems for hyperproperties specified in HyperLTL and HyperCTL * .  ...  We study information flow properties of an I2C bus master, the symmetric access to a shared resource in a mutual exclusion protocol, and the functional correctness of encoders and decoders for error resistant  ...  Acknowledgements We thank Hans-Jörg Peter for valuable discussions and for synthesizing models for the case studies, Heinrich Ody for joint work on an early prototype of the tool, and Heidy Khlaaf for  ... 
doi:10.1007/978-3-319-21690-4_3 fatcat:tkah7loxufglvoa5up6iwd44tm

On the limits of refinement-testing for model-checking CSP

Toby Murray
2011 Formal Aspects of Computing  
CSP allows multi-part events to be defined, where a dot is used to separate each part of an event.  ...  Refinement-checking, as embodied in tools like FDR, PAT and ProB, is a popular approach for model-checking refinement-closed predicates of CSP processes.  ...  This paper builds and extends upon work in my D.Phil. thesis [Mur10] , which was supervised by, and benefited from the feedback of, Gavin Lowe, to whom I'm grateful.  ... 
doi:10.1007/s00165-011-0183-6 fatcat:vv4yg6vfkndutbabg3ttvum2ty

Verifying Security Policies in Multi-agent Workflows with Loops

Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zălinescu
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
The information flow policies are specified in a temporal logic for hyperproperties.  ...  Our workflow description language allows for loops, non-deterministic choice, and an unbounded number of participating agents.  ...  FI 936/2-1) in the priority program "Reliably Secure So ware Systems -RS3", in the doctorate program "Program and Model Analysis -PUMA" (no. 1480), and as part of the Collaborative Research Center "Methods  ... 
doi:10.1145/3133956.3134080 dblp:conf/ccs/Finkbeiner0SZ17 fatcat:bjj5isptpjbklj6ozdxvwtyr6i

Asynchronous Extensions of HyperLTL [article]

Laura Bozzelli, Adriano Peron, Cesar Sanchez
2021 arXiv   pre-print
Temporal logics for hyperproperties studied in the literature, including HyperLTL, assume a synchronous semantics and enjoy a decidable model checking problem.  ...  Both of these extensions are useful, for instance, to formulate asynchronous variants of information-flow security properties. We show that for these logics, model checking is in general undecidable.  ...  CONTEXT HYPERLTL In this section, we introduce an alternative logical framework for specifying asynchronous linear-time hyperproperties.  ... 
arXiv:2104.12886v1 fatcat:gmnmhysd6ffvdcidcjpj4dlxiq

Privacy-Preserving Resilience of Cyber-Physical Systems to Adversaries [article]

Bhaskar Ramasubramanian, Luyao Niu, Andrew Clark, Linda Bushnell, Radha Poovendran
2020 arXiv   pre-print
In this paper, we consider a CPS that has to satisfy a linear temporal logic (LTL) objective in the presence of two kinds of adversaries.  ...  A cyber-physical system (CPS) is expected to be resilient to more than one type of adversary.  ...  Since then, it has been studied for privacy-preserving consensus in multi-agent dynamical systems [31] , networked systems [32] , and linear quadratic control for multi-agent systems [11] .  ... 
arXiv:2007.13272v1 fatcat:ogd6cf2bpjaczdnonow5osgmm4

Explainable Software for Cyber-Physical Systems (ES4CPS): Report from the GI Dagstuhl Seminar 19023, January 06-11 2019, Schloss Dagstuhl [article]

Joel Greenyer, Malte Lochau, Thomas Vogel
2019 arXiv   pre-print
The seminar was concerned with the challenge that for future Cyber-Physical Systems (CPS), it will become increasingly relevant to explain their behavior (past, current, and future behavior, why a certain  ...  This report documents the program and results of the GI-Dagstuhl Seminar 19023 on Explainable Software for Cyber-Physical Systems (ES4CPS).  ...  Acknowledgments We would like to thank the Gesellschaft for Informatik e.V. (GI, German Society for Informatics) and Schloss Dagstuhl for partially funding this seminar.  ... 
arXiv:1904.11851v1 fatcat:r2r5ac6hmnel3f6weiynjwunni

Secure-by-Construction Synthesis of Cyber-Physical Systems [article]

Siyuan Liu, Ashutosh Trivedi, Xiang Yin, Majid Zamani
2022 arXiv   pre-print
Unfortunately, in the security-critical control systems, the security properties are verified ex post facto the design process in a way that undermines the correct-by-construction paradigm.  ...  A remarkable progress has been made in scaling the scope of applicability of correct-by-construction synthesis -- with a focus on cyber-physical systems that tie discrete-event control with continuous  ...  Security for Network Multi-Agent CPS.  ... 
arXiv:2202.06677v1 fatcat:366ep562mjc3xf5muj3evfzgtm

On Distributed Runtime Verification by Aggregate Computing

Giorgio Audrito, Ferruccio Damiani, Volker Stolz, Mirko Viroli
2019 Electronic Proceedings in Theoretical Computer Science  
Distributed runtime verification is runtime verification in connection with distributed systems: it comprises both monitoring of distributed systems and using distributed systems for monitoring.  ...  In this position paper we argue, by means of simple examples, that aggregate computing is particularly well suited for implementing distributed monitors.  ...  We thank the anonymous VORTEX 2018 reviewers for insightful comments and suggestions for improving the presentation.  ... 
doi:10.4204/eptcs.302.4 fatcat:cemnjfrbp5brjd647bwujhlo64

Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond

Alessandro Aldini
2020 Electronic Proceedings in Theoretical Computer Science  
They are essential in characterizing the behaviour of many critical systems and in estimating their properties.  ...  In the same period, they represented the central theme of the series of workshops entitled Quantitative Aspects of Programming Languages and Systems (QAPL) and born in 2001.  ...  and lower bounds in the more general setting of hyperproperties [148] .  ... 
doi:10.4204/eptcs.312.1 fatcat:4fjvygbppjbq3k5ury2kvue3nq

A Survey of Challenges for Runtime Verification from Advanced Application Domains (Beyond Software) [article]

César Sánchez and Gerardo Schneider and Wolfgang Ahrendt and Ezio Bartocci and Domenico Bianculli and Christian Colombo and Yliés Falcone and Adrian Francalanza and Sran Krstić and Joa̋o M. Lourenço and Dejan Nickovic and Gordon J. Pace and Jose Rufino and Julien Signoles and Dmitriy Traytel and Alexander Weiss
2018 arXiv   pre-print
In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges  ...  systems.  ...  The authors would like to thank Fonenantsoa Maurica and Pablo Picazo-Sanchez for their feedback on parts of a preliminary version of this document.  ... 
arXiv:1811.06740v1 fatcat:4bxx5tvfpzez3jidsj22flibv4
« Previous Showing results 1 — 15 out of 35 results