Seuraa
Nikola Beneš
Nikola Beneš
Assistant Professor, Faculty of Informatics, Masaryk University
Vahvistettu sähköpostiosoite verkkotunnuksessa fi.muni.cz
Nimike
Viittaukset
Viittaukset
Vuosi
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
752015
On determinism in modal transition systems
N Beneš, J Křetínský, KG Larsen, J Srba
Theoretical Computer Science 410 (41), 4026-4043, 2009
552009
AEON: attractor bifurcation analysis of parametrised Boolean networks
N Beneš, L Brim, J Kadlecaj, S Pastva, D Šafránek
Computer Aided Verification: 32nd International Conference, CAV 2020, Los …, 2020
482020
Parametric modal transition systems
N Beneš, J Křetínský, KG Larsen, MH Møller, J Srba
Automated Technology for Verification and Analysis: 9th International …, 2011
432011
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, 45-63, 2016
412016
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
Checking thorough refinement on modal transition systems is EXPTIME-complete
N Beneš, J Křetínský, KG Larsen, J Srba
Theoretical Aspects of Computing-ICTAC 2009: 6th International Colloquium …, 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
Recursive online enumeration of all minimal unsatisfiable subsets
J Bendík, I Černá, N Beneš
Automated Technology for Verification and Analysis: 16th International …, 2018
312018
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
FM 2016: Formal Methods: 21st International Symposium, Limassol, Cyprus …, 2016
272016
LTL parameter synthesis of parametric timed automata
P Bezděk, N Beneš, J Barnat, I Černá
Software Engineering and Formal Methods: 14th International Conference, SEFM …, 2016
262016
Parallel SMT-based parameter synthesis with application to piecewise multi-affine systems
N Beneš, L Brim, M Demko, S Pastva, D Šafránek
Automated Technology for Verification and Analysis: 14th International …, 2016
232016
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
222023
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
222022
Formal analysis of qualitative long-term behaviour in parametrised boolean networks
N Beneš, L Brim, S Pastva, J Poláček, D Šafránek
Formal Methods and Software Engineering: 21st International Conference on …, 2019
212019
Detecting attractors in biological models with uncertain parameters
J Barnat, N Beneš, L Brim, M Demko, M Hajnal, S Pastva, D Šafránek
Computational Methods in Systems Biology: 15th International Conference …, 2017
212017
Tunable online MUS/MSS enumeration
J Bendík, N Benes, I Cerná, J Barnat
arXiv preprint arXiv:1606.03289, 2016
212016
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
Pithya: a parallel tool for parameter synthesis of piecewise multi-affine dynamical systems
N Beneš, L Brim, M Demko, S Pastva, D Šafránek
Computer Aided Verification: 29th International Conference, CAV 2017 …, 2017
192017
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20