activity
20112026
most citedBDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs

3 citations · 8 across the 9 of their papers we have counts for

collaborators

10 papers

q-bio.MN2026

Inference of Qualitative Models from Steady-State Data via Weighted MaxSMT

Ondřej Huvar, Nikola Beneš, Martin Jonáš +2

Qualitative models provide crucial instruments for modelling complex biological systems. While advances in automated reasoning and symbolic encodings have enabled rigorous inferenc…

cs.DS2021★ 3 cited

BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs

Nikola Beneš, Luboš Brim, Samuel Pastva +1

Edge-coloured directed graphs provide an essential structure for modelling and analysis of complex systems arising in many scientific disciplines (e.g. feature-oriented systems, ge…

cs.SE2017

Finding Regressions in Projects under Version Control Systems

Jaroslav Bendik, Nikola Benes, Ivana Cerna

Version Control Systems (VCS) are frequently used to support development of large-scale software projects. A typical VCS repository of a large project can contain various intertwin…

cs.LO2017

Recursive Online Enumeration of All Minimal Unsatisfiable Subsets

Jaroslav Bendik, Ivana Cerna, Nikola Benes

In various areas of computer science, we deal with a set of constraints to be satisfied. If the constraints cannot be satisfied simultaneously, it is desirable to identify the core…

cs.AI2016

Tunable Online MUS/MSS Enumeration

Jaroslav Bendik, Nikola Benes, Ivana Cerna +1

In various areas of computer science, the problem of dealing with a set of constraints arises. If the set of constraints is unsatisfiable, one may ask for a minimal description of…

cs.SE2015

Analysing Sanity of Requirements for Avionics Systems (Preliminary Version)

Jiří Barnat, Petr Bauch, Nikola Beneš +3

In the last decade it became a common practice to formalise software requirements to improve the clarity of users' expectations. In this work we build on the fact that functional r…

cs.FL2015★ 1 cited

Language Emptiness of Continuous-Time Parametric Timed Automata

Nikola Beneš, Peter Bezděk, Kim G. Larsen +1

Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem…

cs.FL2014

LTL Parameter Synthesis of Parametric Timed Automata

Peter Bezděk, Nikola Beneš, Jiří Barnat +1

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on par…

cs.LO2013★ 3 cited

Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory

Nikola Beneš, Benoît Delahaye, Uli Fahrenberg +2

There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal o…

cs.SE2011★ 1 cited

CoInDiVinE: Parallel Distributed Model Checker for Component-Based Systems

Nikola Beneš, Ivana Černá, Milan Křivánek

CoInDiVinE is a tool for parallel distributed model checking of interactions among components in hierarchical component-based systems. The tool extends the DiVinE framework with a…