Stebėti
Quentin Peyras
Quentin Peyras
EPITA Toulouse (LRE)
Patvirtintas el. paštas epita.fr
Pavadinimas
Cituota
Cituota
Metai
Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
A Jovanović, M Kwiatkowska, G Norman, Q Peyras
Theoretical Computer Science 669, 1-21, 2017
102017
A bounded domain property for an expressive fragment of first-order linear temporal logic
Q Peyras, J Brunel, D Chemouil
26th International Symposium on Temporal Representation and Reasoning (TIME …, 2019
32019
A decidable and expressive fragment of many-sorted first-order linear temporal logic
Q Peyras, J Brunel, D Chemouil
Information and Computation 280, 104641, 2021
22021
Sound verification procedures for temporal properties of infinite-state systems
Q Peyras, JP Bodeveix, J Brunel, D Chemouil
Computer Aided Verification: 33rd International Conference, CAV 2021 …, 2021
22021
Propriété du domaine borné pour la logique temporelle linéaire du premier ordre et applications à la vérification de systèmes à états infinis
Q Peyras
Institut Superieur de l'Aeronautique et de l'Espace (ISAE), 2022
2022
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–5