Temporal Reasoning on Incomplete Paths

Fisman, Dana; Kugler, Hillel

doi:10.1007/978-3-030-03421-4_3

Cited by 8 publications

(4 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More broadly, viewing biological systems as reactive systems leads naturally to specifying their behavior using temporal logic and applying model checking (see e.g. [ 8 , 13 ] and references within).…”

Section: Related Workmentioning

confidence: 99%

Formal Semantics and Verification of Network-Based Biocomputation Circuits

Aluf-Medina

Korten

Raviv

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Network-Based Biocomputation Circuits (NBCs) offer a new paradigm for solving complex computational problems by utilizing biological agents that operate in parallel to explore manufactured planar devices. The approach can also have future applications in diagnostics and medicine by combining NBCs computational power with the ability to interface with biological material. To realize this potential, devices should be designed in a way that ensures their correctness and robust operation. For this purpose, formal methods and tools can offer significant advantages by allowing investigation of design limitations and detection of errors before manufacturing and experimentation. Here we define a computational model for NBCs by providing formal semantics to NBC circuits. We present a formal verification-based approach and prototype tool that can assist in the design of NBCs by enabling verification of a given design’s correctness. Our tool allows verification of the correctness of NBC designs for several NP-Complete problems, including the Subset Sum, Exact Cover and Satisfiability problems and can be extended to other NBC implementations. Our approach is based on defining transition systems for NBCs and using temporal logic for specifying and proving properties of the design using model checking. Our formal model can also serve as a starting point for computational complexity studies of the power and limitations of NBC systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Formal Semantics and Verification of Network-Based Biocomputation Circuits

Aluf-Medina

Korten

Raviv

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…On the other hand P, P is a tight witness since P, P Xtt and every prefix of it does not satisfy Xtt. Notice that it would not be simple to just use finite trace semantics for full LTL [11,15,10,4,5]. Consider for example, the trace {a} , which satisfies Ga.…”

Section: Monitors As Triggers For Ltl Formulasmentioning

confidence: 99%

Incorporating Monitors in Reactive Synthesis without Paying the Price

Azzopardi¹,

Piterman²,

Schneider³

2021

Preprint

View full text Add to dashboard Cite

Temporal synthesis attempts to construct reactive programs that satisfy a given declarative (LTL) formula. Practitioners have found it challenging to work exclusively with declarative specifications, and have found languages that combine modelling with declarative specifications more useful. Synthesised controllers may also need to work with pre-existing or manually constructed programs. In this paper we explore an approach that combines synthesis of declarative specifications in the presence of an existing behaviour model as a monitor, with the benefit of not having to reason about the state space of the monitor. We suggest a formal language with automata monitors as non-repeating and repeating triggers for LTL formulas. We use symbolic automata with memory as triggers, resulting in a strictly more expressive and succinct language than existing regular expression triggers. We give a compositional synthesis procedure for this language, where reasoning about the monitor state space is minimal. To show the advantages of our approach we apply it to specifications requiring counting and constraints over arbitrarily long sequence of events, where we can also see the power of parametrisation, easily handled in our approach. We provide a tool to construct controllers (in the form of symbolic automata) for our language.

show abstract

“…Three valued logic has also been applied to model checking LTL properties over discrete systems with partially known state spaces [11]. Fisman and Kugler [23] also investigated a more general semantics for Linear Temporal Logic (LTL) and STL over a number of different forms of incomplete traces.…”

Section: Related Workmentioning

confidence: 99%

Property-Directed Verified Monitoring of Signal Temporal Logic

Stark

2020

Runtime Verification

View full text Add to dashboard Cite

Signal Temporal Logic monitoring over numerical simulation traces has emerged as an effective approach to approximate verification of continuous and hybrid systems. In this report we explore an exact verification procedure for STL properties based on monitoring verified traces in the form of Taylor model flowpipes as produced by the Flow* verified integrator. We explore how tight integration with Flow*'s symbolic flowpipe representation can lead to more precise and more efficient monitoring. We then show how the performance of monitoring can be increased substantially by introducing masks, a property-directed refinement of our method which restricts flowpipe monitoring to the time regions relevant to the overall truth of a complex proposition. Finally, we apply our implementation of these methods to verifying properties of a challenging continuous system, evaluating the impact of each aspect of our procedure on monitoring performance.

show abstract

Temporal Reasoning on Incomplete Paths

Cited by 8 publications

References 44 publications

Formal Semantics and Verification of Network-Based Biocomputation Circuits

Formal Semantics and Verification of Network-Based Biocomputation Circuits

Incorporating Monitors in Reactive Synthesis without Paying the Price

Property-Directed Verified Monitoring of Signal Temporal Logic

Contact Info

Product

Resources

About