[go: up one dir, main page]
Follow
Nikola Beneš
Nikola Beneš
Assistant Professor, Faculty of Informatics, Masaryk University
Verified email at fi.muni.cz
Title
Cited by
Cited by
Year
Language emptiness of continuous-time parametric timed automata
N Beneš, P Bezděk, KG Larsen, J Srba
International Colloquium on Automata, Languages, and Programming, 69-81, 2015
772015
AEON: attractor bifurcation analysis of parametrised Boolean networks
N Beneš, L Brim, J Kadlecaj, S Pastva, D Šafránek
International Conference on Computer Aided Verification, 569-581, 2020
622020
On determinism in modal transition systems
N Beneš, J Křetínský, KG Larsen, J Srba
Theoretical Computer Science 410 (41), 4026-4043, 2009
562009
Parametric modal transition systems
N Beneš, J Křetínský, KG Larsen, MH Møller, J Srba
International Symposium on Automated Technology for Verification and …, 2011
452011
Analysing sanity of requirements for avionics systems
J Barnat, P Bauch, N Beneš, L Brim, J Beran, T Kratochvíla
Formal Aspects of Computing 28 (1), 45-63, 2016
442016
Component-interaction automata approach (CoIn)
B Zimmerova, P Vařeková, N Beneš, I Černá, L Brim, J Sochor
The Common Component Modeling Example: Comparing Software Component Models …, 2008
39*2008
AEON. py: Python library for attractor analysis in asynchronous Boolean networks
N Beneš, L Brim, O Huvar, S Pastva, D Šafránek, E Šmijáková
Bioinformatics 38 (21), 4978-4980, 2022
372022
Recursive online enumeration of all minimal unsatisfiable subsets
J Bendík, I Černá, N Beneš
International symposium on automated technology for verification and …, 2018
372018
Checking thorough refinement on modal transition systems is EXPTIME-complete
N Beneš, J Křetínský, KG Larsen, J Srba
International Colloquium on Theoretical Aspects of Computing, 112-126, 2009
372009
Modal transition systems: Composition and LTL model checking
N Beneš, I Černá, J Křetínský
International Symposium on Automated Technology for Verification and …, 2011
362011
Boolean network sketches: a unifying framework for logical model inference
N Beneš, L Brim, O Huvar, S Pastva, D Šafránek
Bioinformatics 39 (4), btad158, 2023
312023
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
N Beneš, B Delahaye, U Fahrenberg, J Křetínský, A Legay
International Conference on Concurrency Theory, 76-90, 2013
282013
A model checking approach to discrete bifurcation analysis
N Beneš, L Brim, M Demko, S Pastva, D Šafránek
International Symposium on Formal Methods, 85-101, 2016
272016
LTL parameter synthesis of parametric timed automata
P Bezděk, N Beneš, J Barnat, I Černá
International Conference on Software Engineering and Formal Methods, 172-187, 2016
252016
Parallel SMT-based parameter synthesis with application to piecewise multi-affine systems
N Beneš, L Brim, M Demko, S Pastva, D Šafránek
International Symposium on Automated Technology for Verification and …, 2016
232016
Formal analysis of qualitative long-term behaviour in parametrised boolean networks
N Beneš, L Brim, S Pastva, J Poláček, D Šafránek
International conference on formal engineering methods, 353-369, 2019
222019
Tunable online MUS/MSS enumeration
J Bendík, N Benes, I Cerná, J Barnat
arXiv preprint arXiv:1606.03289, 2016
222016
Detecting attractors in biological models with uncertain parameters
J Barnat, N Beneš, L Brim, M Demko, M Hajnal, S Pastva, D Šafránek
International Conference on Computational Methods in Systems Biology, 40-56, 2017
212017
Computing bottom SCCs symbolically using transition guided reduction
N Beneš, L Brim, S Pastva, D Šafránek
International Conference on Computer Aided Verification, 505-528, 2021
202021
Complete composition operators for IOCO-testing theory
N Beneš, P Daca, TA Henzinger, J Křetínský, D Ničković
Proceedings of the 18th International ACM SIGSOFT Symposium on Component …, 2015
202015
The system can't perform the operation now. Try again later.
Articles 1–20