Abstract
AbstractReal-time systems are notoriously hard to verify due to nondeterminism, concurrency and timing constraints. When timing constants are uncertain (in early the design phase, or due to slight variations of the timing bounds), timed model checking techniques may not be satisfactory. In contrast, parametric timed model checking synthesizes timing values ensuring correctness. takes as input an extension of parametric timed automata (PTAs), a powerful formalism to formally verify critical real-time systems. extends PTAs with multi-rate clocks, global rational-valued variables and a set of additional useful features. We describe here the new features and algorithms offered by 3, that moved along the years from a simple prototype dedicated to robustness analysis to a standalone parametric model checker for timed systems.
Publisher
Springer International Publishing
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Spreadsheet-based Configuration of Families of Real-Time Specifications;Electronic Proceedings in Theoretical Computer Science;2023-10-31
2. Configuring Timing Parameters to Ensure Execution-Time Opacity in Timed Automata;Electronic Proceedings in Theoretical Computer Science;2023-10-31
3. MoULDyS: Monitoring of autonomous systems in the presence of uncertainties;Science of Computer Programming;2023-08
4. Expiring opacity problems in parametric timed automata;2023 27th International Conference on Engineering of Complex Computer Systems (ICECCS);2023-06-14
5. Mutant Equivalence as Monotonicity in Parametric Timed Games;2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE);2023-05