Simon Busard
TitleCited byYear
Verification of railway interlocking systems
S Busard, Q Cappart, C Limbrée, C Pecheur, P Schaus
arXiv preprint arXiv:1506.03554, 2015
232015
Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
S Busard, C Pecheur, H Qu, F Raimondi
Information and Computation 242, 128-156, 2015
212015
PyNuSMV: NuSMV as a python library
S Busard, C Pecheur
NASA Formal Methods Symposium, 453-458, 2013
162013
Improving the model checking of strategies under partial observability and fairness constraints
S Busard, C Pecheur, H Qu, F Raimondi
International Conference on Formal Engineering Methods, 27-42, 2014
152014
Reasoning about Strategies under Partial Observability and Fairness Constraints
S Busard, C Pecheur, H Qu, F Raimondi
EPTCS 112, 71-79, 2013
92013
Symbolic model checking of multi-modal logics: uniform strategies and rich explanations
S Busard
University of Louvain, Belgium, 2017
82017
Rich counter-examples for temporal-epistemic logic model checking
S Busard, C Pecheur
arXiv preprint arXiv:1202.4509, 2012
72012
Comparing approaches for model-checking strategies under imperfect information and fairness constraints
S Busard, C Pecheur, H Qu, F Raimondi
International Journal on Software Tools for Technology Transfer 21 (4), 449-469, 2019
2019
Producing Explanations for Rich Logics
S Busard, C Pecheur
International Symposium on Formal Methods, 129-146, 2018
2018
PyNuSMV Documentation
S Busard
2017
A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability
S Busard, C Pecheur
arXiv preprint arXiv:1709.02106, 2017
2017
Rich counter-examples for ACTL model checking
S Busard, C Pecheur
Grascomp's Day, 2011
2011
Computing minimal representations with binary decision diagrams
A Royers, C Pecheur, S Busard
Visualization of binary decision diagram
X Dollé, C Pecheur, S Busard
The system can't perform the operation now. Try again later.
Articles 1–14