A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Framework for Ranking Vacuity Results
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
Most vacuity algorithms are based on checking the effect of applying mutations on the specification. It has been recognized that vacuity results differ in their significance. ...
From a practical point of view, we propose an efficient algorithm for estimating the probability of LTL formulas, and argue that ranking vacuity results according to our probability-based criteria corresponds ...
We thank Moshe Vardi for helpful discussions, and reviewers of an earlier version of this paper for helpful comments and suggestions. ...
doi:10.1007/978-3-319-02444-8_12
fatcat:rgdnpuukhjd3rfmhufzkcv5diy
Model Repair for Probabilistic Systems
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Given a probabilistic system M and a probabilistic temporal logic formula φ such that M fails to satisfy φ, the Model Repair problem is to find an M that satisfies φ and differs from M only in the transition ...
Using a new version of parametric probabilistic model checking, we show how the Model Repair problem can be reduced to a nonlinear optimization problem with a minimal-cost objective function, thereby yielding ...
Given a probabilistic system M and a probabilistic temporal logic formula φ such that M fails to satisfy φ, the probabilistic Model Repair problem is to find an M that satisfies φ and differs from M only ...
doi:10.1007/978-3-642-19835-9_30
fatcat:dfleihlucjgyhozgqxia7kdwzy
Formalizing and Reasoning about Quality
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As an adequate specification formalism we introduce the linear temporal logic LTL[F]. ...
The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0, 1]. ...
We introduce and study the linear temporal logic LTL[F], which extends LTL with an arbitrary set F of functions over [0, 1]. ...
doi:10.1007/978-3-642-39212-2_3
fatcat:pu6uxmknurgrnpnugbt3acl2l4
Spectra: a specification language for reactive systems
2021
Journal of Software and Systems Modeling
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We present the language in detail and give an overview of its tool set. ...
Spectra comes with the Spectra Tools, a set of analyses, including a synthesizer to obtain a correct-by-construction implementation, several means for executing the resulting controller, and additional ...
We thank Elizabeth Firman, Aviv Kuvent, Or Pistiner, Rafi Shalom, Ilia Shevrin, Keren Solodkin, and Yoni Wolbe for their contribution to the implementation of Spectra Tools. ...
doi:10.1007/s10270-021-00868-z
fatcat:okjmdffdxbdxdladfiaqztjqu4
Linear Temporal Logic Symbolic Model Checking
2011
Computer Science Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This survey provides a perspective on the formal verification technique of linear temporal logic (LTL) symbolic model checking, from its history and evolution leading up to the state-of-the-art. ...
We include an in-depth examination of the algorithms underlying the symbolic model-checking procedure, show proofs of important theorems, and point to directions of ongoing research. ...
Acknowledgements Thanks to Moshe Y. Vardi, Eric W. D. Rozier, and Misty D. Davies for insightful comments on earlier drafts of this paper. ...
doi:10.1016/j.cosrev.2010.06.002
fatcat:e4zzsmtvmbhhfilofosb4ucqni
A Platform-Based Design Methodology With Contracts and Related Tools for the Design of Cyber-Physical Systems
2015
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The design is carried out as a sequence of refinement steps from a high-level specification to an implementation built out of a library of components at the lower level. ...
We introduce a platform-based design methodology that uses contracts to specify and abstract the components of a cyber-physical system (CPS), and provide formal support to the entire CPS design flow. ...
Other operations on contracts, as defined in Section II-C, can be reduced to special instances of the validity or satisfiability checking problem for temporal logic (or quantified temporal logic [18] ...
doi:10.1109/jproc.2015.2453253
fatcat:symvbgghdfar3ey2dbwp3l5vrm
Low-Effort Specification Debugging and Analysis
2014
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Reactive synthesis deals with the automated construction of implementations of reactive systems from their specifications. ...
To make the approach feasible in practice, systems engineers need effective and efficient means of debugging these specifications. ...
We can characterize subsets of such words by a formula in linear temporal logic (LTL). ...
doi:10.4204/eptcs.157.12
fatcat:pqrdqzblpvbrrbfec53m7wz22m
Verified Synthesis of Optimal Safety Controllers for Human-Robot Collaboration
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The resulting controller can detect the occurrence of hazards, move the process into a safe state, and, in certain circumstances, return the process to an operational state from which it can resume its ...
Our controller synthesis, verification and validation approach is informed by the process, risk analysis, and relevant safety regulations for the target application. ...
To improve our approach regarding the synthesis over homogeneous action systems, their algorithms could be integrated into our MDP synthesis tool chain, for example, in addition to Prism or underpinning ...
arXiv:2106.06604v1
fatcat:jxvovhkceveybmn4xgo5ei4kxi
Safety Controller Synthesis for Collaborative Robots
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The synthesised ASC can detect the occurrence of hazards, move the process into a safe state, and, in certain circumstances, return the process to an operational state from which it can resume its original ...
Key among these challenges is the need to assure the correctness of ASCs under reasonably weak assumptions. ...
Verification of M is based on probabilistic computation tree logic (PCTL) whose properties over AP are formed by φ ::= | a | ¬φ | φ ∧ φ | E φ | A ϕ and ϕ ::= X φ | φ U φ with a ∈ AP ; an optional bound ...
arXiv:2007.03340v1
fatcat:otgervvp2vbdljbtyhrvkxunn4
Bounded Satisfiability for PCTL
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We have implemented our techniques and found that they can be applied to the practical problem of sanity checking -- a procedure that allows a system designer to check whether their formula has an unexpectedly ...
We propose a procedure to decide whether or not a given PCTL formula has an implementable model by reducing it to an SMT problem. ...
We use Pr M as an abbreviation of Pr ι M .
PCTL Probabilistic computation tree logic (PCTL) [9] is a probabilistic variant of CTL, where path quantifiers are replaced by probabilistic operators. ...
arXiv:1204.0469v1
fatcat:u4psnrq3lng77euslvv7qpjwsm
Synthesizing Adaptive Test Strategies from Temporal Logic Specifications
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We propose a new approach to compute test strategies for reactive systems from a given temporal logic specification using formal methods. ...
Since the specification may not define the system behavior completely, we use reactive synthesis algorithms with partial information. ...
Linear Temporal Logic We use Linear Temporal Logic (LTL) [45] as a specification language for reactive systems. ...
arXiv:1809.01607v1
fatcat:uitvv5x2qjfkdcebx6wvt7hei4
Formally Reasoning About Quality
2016
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this article, we introduce two quantitative extensions of Linear Temporal Logic (LTL), one by propositional quality operators and one by discounting operators. ...
The second, temporal quality, refines the "eventually" operators of the specification formalism with discounting operators, whose semantics takes into an account the delay incurred in their satisfaction ...
We introduce and study the linear temporal logic LTL [F] , that extends LTL with an arbitrary set F of functions over [0, 1] . ...
doi:10.1145/2875421
fatcat:ni3xosyq2vc6vgupdaijcghzmi
Safety Controller Synthesis for Collaborative Robots
2020
2020 25th International Conference on Engineering of Complex Computer Systems (ICECCS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Such an ASC can detect the occurrence of hazards, move the process into a safe state, and, in certain circumstances, return the process to an operational state from which it can resume its original task ...
Key among these challenges is the need to assure the correctness of ASCs under reasonably weak assumptions. ...
Verification of M is based on probabilistic computation tree logic (PCTL) whose properties over AP are formed by φ ::= ⊤ | a | ¬φ | φ ∧ φ | E φ | A ϕ and ϕ ::= X φ | φ U φ with a ∈ AP ; an optional bound ...
doi:10.1109/iceccs51672.2020.00017
fatcat:l6j47ny4knagph26jdzqolpa7q
Layering Assume-Guarantee Contracts for Hierarchical System Design
2018
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper presents a method to algorithmically decompose system-level temporal logic specifications in CPSs into lower level specifications for individual components, in the form of assume-guarantee contracts ...
We define an operator for forming open systems from closed systems, based on a variant of the "while-plus" operator. ...
Semantics of Modal Logic Temporal logic serves for reasoning about dynamics, because it is interpreted over sequences of states (for linear semantics). ...
doi:10.1109/jproc.2018.2834926
fatcat:sqxfb5hapvcvbi4fpw7r3jj4le
Causality, Randomness, Intelligibility, and the Epistemology of the Cell
2010
Current Genomics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In analogy with a multi-faceted factory, the cell utilizes a highly parallel distributed control system to maintain its organization and regulate its dynamical operation in the face of both internal and ...
being a consequence of the need to ignore a large number of factors while modeling relatively few in an extremely complex environment. ...
application of such systems to the machinery of the cell. ...
doi:10.2174/138920210791233072
pmid:21119887
pmcid:PMC2930662
fatcat:fllmrnq3prbrpibxg52qoobz2q
« Previous
Showing results 1 — 15 out of 52 results