2020/07/02 by Jéron, Thierry, Markey, Nicolas, Mentré, David +2
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Software Engineering (cs.SE)
paper · doi:10.48550/arxiv.2007.01014
Requirements engineering is a key phase in the development process. Ensuring that requirements are consistent is essential so that they do not conflict and admit implementations. We consider the formal verification of rt-consistency, which imposes that the inevitability of definitive errors of a requirement should be anticipated, and that of partial consistency, which was recently introduced as a more effective check. We generalize and formalize both notions for discrete-time timed automata, develop three incremental algorithms, and present experimental results.