Merge and Conquer: State Merging in Parametric Timed Automata-Reference-Cited by-同舟云学术

Merge and Conquer: State Merging in Parametric Timed Automata

Published:2013 Issue: Volume: Page:381-396
ISSN:0302-9743
Container-title:Automated Technology for Verification and Analysis
language:
Short-container-title:

Author:

André Étienne,Fribourg Laurent,Soulat Romain

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-02444-8_27

Reference19 articles.

1. Lecture Notes in Computer Science;Y. Abdeddaïm,2002

2. Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC, pp. 592–601. ACM (1993)

3. André, É.: Dynamic clock elimination in parametric timed automata. In: FSFMA. OpenAccess Series in Informatics, vol. 31, pp. 18–31. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing (2013)

4. Lecture Notes in Computer Science;É. André,2012

5. Lecture Notes in Computer Science;É. André,2012

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Zone extrapolations in parametric timed automata;Innovations in Systems and Software Engineering;2024-04-17

2. Symbolic analysis and parameter synthesis for networks of parametric timed automata with global variables using Maude and SMT solving;Science of Computer Programming;2024-03

3. Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata;Proceedings of the 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems;2022-11-29

4. Efficient Convex Zone Merging in Parametric Timed Automata;Lecture Notes in Computer Science;2022

5. IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability;Computer Aided Verification;2021