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.
CITATION STYLE
Jéron, T., Markey, N., Mentré, D., Noguchi, R., & Sankur, O. (2020). Incremental Methods for Checking Real-Time Consistency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12288 LNCS, pp. 249–264). Springer. https://doi.org/10.1007/978-3-030-57628-8_15
Mendeley helps you to discover research relevant for your work.