3 citations · 8 across the 9 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
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.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…