Étienne André
Étienne André
Université Paris 13, LIPN, CNRS, UMR 7030, F-93430, Villetaneuse, France
Verified email at univ-paris13.fr - Homepage
Cited by
Cited by
An inverse method for parametric timed automata
É André, T Chatain, L Fribourg, E Encrenaz
International Journal of Foundations of Computer Science 20 (05), 819-836, 2009
IMITATOR 2.5: A tool for analyzing robustness in scheduling problems
É André, L Fribourg, U Kühne, R Soulat
International Symposium on Formal Methods, 33-36, 2012
Modeling and verifying hierarchical real-time systems using stateful timed CSP
J Sun, Y Liu, JS Dong, Y Liu, L Shi, É André
ACM Transactions on Software Engineering and Methodology (TOSEM) 22 (1), 1-29, 2013
A formal semantics for complete UML state machines with communications
S Liu, Y Liu, E André, C Choppy, J Sun, B Wadhwa, JS Dong
International Conference on Integrated Formal Methods, 331-346, 2013
Behavioral cartography of timed automata
É André, L Fribourg
International Workshop on Reachability Problems, 76-90, 2010
The inverse method
É André, R Soulat
FOCUS series in computer engineering and information technology. ISTE Ltd …, 2013
Automated runtime recovery for QoS-based service composition
TH Tan, M Chen, É André, J Sun, Y Liu, JS Dong
Proceedings of the 23rd international conference on World wide web, 563-574, 2014
What’s decidable about parametric timed automata?
É André
International Journal on Software Tools for Technology Transfer 21 (2), 203-219, 2019
Language preservation problems in parametric timed automata
É André, N Markey
International Conference on Formal Modeling and Analysis of Timed Systems, 27-43, 2015
IMITATOR II: A tool for solving the good parameters problem in timed automata
É André
arXiv preprint arXiv:1011.0223, 2010
IMITATOR: A tool for synthesizing constraints on timing bounds of timed automata
É André
International Colloquium on Theoretical Aspects of Computing, 336-342, 2009
What’s decidable about parametric timed automata?
É André
International Workshop on Formal Techniques for Safety-Critical Systems, 52-68, 2015
Learning assumptions for compositionalverification of timed systems
SW Lin, E André, Y Liu, J Sun, JS Dong
IEEE Transactions on Software Engineering 40 (2), 137-153, 2013
Dynamic synthesis of local time requirement for service composition
TH Tan, É André, J Sun, Y Liu, JS Dong, M Chen
2013 35th International Conference on Software Engineering (ICSE), 542-551, 2013
An efficient algorithm for learning event-recording automata
SW Lin, É André, JS Dong, J Sun, Y Liu
International Symposium on Automated Technology for Verification and …, 2011
An inverse method for parametric timed automata
É André, T Chatain, L Fribourg, E Encrenaz
Electronic Notes in Theoretical Computer Science 223, 29-46, 2008
Formalizing non-concurrent UML state machines using colored Petri nets
É André, C Choppy, K Klai
ACM SIGSOFT Software Engineering Notes 37 (4), 1-8, 2012
Parameter synthesis for hierarchical concurrent real-time systems
É André, Y Liu, J Sun, JS Dong
Real-Time Systems 50 (5-6), 620-679, 2014
CosyVerif: An open source extensible verification environment
É André, Y Lembachar, L Petrucci, F Hulin-Hubard, A Linard, L Hillah, ...
2013 18th International Conference on Engineering of Complex Computer …, 2013
Decision problems for parametric timed automata
É André, D Lime, OH Roux
International Conference on Formal Engineering Methods, 400-416, 2016
The system can't perform the operation now. Try again later.
Articles 1–20