# Consistency of Property Specification Patterns with Boolean and Constrained Numerical Signals

arXiv: https://arxiv.org/abs/1712.04162 · HTML: https://mlsanity.com/paper/1712.04162/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Dec 2017.

## Built on by (most cited first, 1 of 1)

- [Computing unsatisfiable cores for LTLf specifications](https://mlsanity.com/paper/2203.04834/) (2022)

## Abstract (arXiv)

Property Specification Patterns (PSPs) have been proposed to solve recurring specification needs, to ease the formalization of requirements, and enable automated verification thereof. In this paper, we extend PSPs by considering Boolean as well as atomic assertions from a constraint system. This extension enables us to reason about functional requirements which could not be captured by basic PSPs. We contribute an encoding from constrained PSPs to LTL formulas, and we show experimental results demonstrating that our approach scales on requirements of realistic size generated using an artificial probabilistic model. Finally, we show that our extension enables us to prove (in)consistency of requirements about an embedded controller for a robotic manipulator.