Scalable Analysis of Real-Time Requirements

Langenfeld, Vincent; Dietsch, Daniel; Westphal, Bernd; Hoenicke, Jochen; Post, Amalinda

doi:10.1109/re.2019.00033

Cited by 22 publications

(9 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other extensions of the SPS include: real-time property patterns [18] which can be translated to metric LTL, Timed CTL, RTGIL, Duration Calculus, Phase Event Automata (PEA) [27], and to Boogie [20]; composite propositions [23,28,29], which address relationships among multiple propositions and are translated to optimized future-time LTL; and specification of semantic subtleties [7,31].…”

Section: Related Workmentioning

confidence: 99%

A compositional proof framework for FRETish requirements

Conrad

Titolo

Giannakopoulou

et al. 2022

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs

View full text Add to dashboard Cite

Structured natural languages provide a trade space between ambiguous natural languages that make up most written requirements, and mathematical formal specifications such as Linear Temporal Logic. FRETish is a structured natural language for the elicitation of system requirements developed at NASA. The related open-source tool Fret provides support for translating FRETish requirements into temporal logic formulas that can be input to several verification and analysis tools. In the context of safety-critical systems, it is crucial to ensure that a generated formula captures the semantics of the corresponding FRETish requirement precisely. This paper presents a rigorous formalization of the FRETish language including a new denotational semantics and a proof of semantic equivalence between FRETish specifications and their temporal logic counterparts computed by Fret. The complete formalization and the proof have been developed in the Prototype Verification System (PVS) theorem prover.

show abstract

Section: Related Workmentioning

confidence: 99%

A compositional proof framework for FRETish requirements

Conrad

Titolo

Giannakopoulou

et al. 2022

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs

View full text Add to dashboard Cite

show abstract

“…Requirements are expressed according to a controlled language called SysReq-CNL, where requirements have the form of action statements guarded by conditions. The approach presented in [9] aims to check some properties or real-time requirements : rt-consistency, consistency and vacuity. Requirements must be written following a tightly constrained English grammar closely related to LTL with the underlying Duration Calculus semantics.…”

Section: Related Workmentioning

confidence: 99%

Investigating Process Algebra Models to Represent Structured Requirements for Time-sensitive CPS

Arnaud¹

2021

Proceedings of the 33rd International Conference on Software Engineering and Knowledge Engineering

View full text Add to dashboard Cite

Cyber-Physical Systems (CPS) contain complex computational components that control physical entities. The design of these components must take into account the realtime and concurrent nature of these systems. Formulating requirements that describe CPS behaviors precisely, ruling out misunderstandings, is a crucial yet difficult endeavor. To increase trust in the requirements, formal methods can be used to check relevant properties of the requirements. We investigate a process algebra to capture real-time behaviors and concurrency in CPS requirements in order to automate their analysis. We use a structured natural language to first express CPS requirements: this takes into account current practice, indeed requirements should be easily writable as well as graspable by stakeholders with various points of view and ease communication among them. At the same time, requirements analysis using simulation or formal validation is possible by taking advantage of the requirements structure. We discuss translation from the structured requirements into the process algebra to automate the overall process. Our approach is implemented and is illustrated by an example issued from CPS4EU project 1 .

show abstract

“…We apply our algorithm to several benchmarks including four case studies that have appeared in the literature, and anonymized benchmarks from [23].…”

Section: Introductionmentioning

confidence: 99%

“…Related Works. Verification algorithms for non-vacuity and rt-consistency were given in [23] based on a reduction of the problems to a safety verification problem, and using a software model checker. Due to efficiency constraints, the presented results are obtained using a partial check: the rt-consistency is checked only for pairs of real-time requirements; nonetheless, the method can also be applied to consider the whole set.…”

Section: Introductionmentioning

confidence: 99%

Repairing Real-Time Requirements

Noguchi

Sankur

Jéron

et al. 2022

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

We consider the problem of repairing inconsistent real-time requirements with respect to two consistency notions: non-vacuity, which means that each requirement can be realized without violating other ones, and rt-consistency, which means that inevitable violations are detected immediately. We provide an iterative algorithm, based on solving SMT queries, to replace designated parameters of real-time requirements with new Boolean expressions and time constraints, so that the resulting set of requirements becomes consistent.

show abstract

Scalable Analysis of Real-Time Requirements

Cited by 22 publications

References 9 publications

A compositional proof framework for FRETish requirements

A compositional proof framework for FRETish requirements

Investigating Process Algebra Models to Represent Structured Requirements for Time-sensitive CPS

Repairing Real-Time Requirements

Contact Info

Product

Resources

About