Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Ivana Černá"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification. However, the exact timi
Externí odkaz:
https://doaj.org/article/a7c5269593584d0ea26578acff2a2dfc
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 72, Iss Proc. PDMC 2011, Pp 63-67 (2011)
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 new input language (component-interaction automata) and a property spe
Externí odkaz:
https://doaj.org/article/6da0194f92bd4e2e9663b09eaef3c809
Autor:
David Šafránek, Jan Láník, Jana Fabriková, Sven Dražan, Ivana Černá, Luboš Brim, Jiří Barnat, Hongwu Ma
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 6, Iss Proc. COMPMOD 2009, Pp 31-45 (2009)
In this paper a novel tool BioDiVinEfor parallel analysis of biological models is presented. The tool allows analysis of biological models specified in terms of a set of chemical reactions. Chemical reactions are transformed into a system of multi-af
Externí odkaz:
https://doaj.org/article/b0bd8ba67c8c46f7994e69d016802d99
Autor:
Hana Hornová, Ivana Černá
Publikováno v:
Proceedings of the XXVII Conference of the Danubian Countries on Hydrological Forecasting and Hydrological Bases of Water Management.
The planned construction of Oder-Danube canal was one of the largest activities, which led to the realization of research projects, which also included construction of boreholes for monitoring groundwater levels. Hydropedological profiles (HP) consis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4bc33bb94a394f3d6921a5dc94e5afa
https://doi.org/10.15407/uhmi.conference.01.02
https://doi.org/10.15407/uhmi.conference.01.02
Autor:
Jaroslav Bendík, Ivana Černá
Publikováno v:
LPAR
Given an unsatisfiable Boolean Formula F in CNF, i.e., a set of clauses, one is often interested in identifying Maximal Satisfiable Subsets (MSSes) of F or, equivalently, the complements of MSSes called Minimal Correction Subsets (MCSes). Since MSSes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ce754bcc727e452a475b74ca6b1184a
https://doi.org/10.29007/8btb
https://doi.org/10.29007/8btb
Autor:
Jaroslav Bendík, Ivana Černá
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030451899
TACAS (1)
TACAS (1)
In many areas of computer science, we are given an unsatisfiable set of constraints with the goal to provide an insight into the unsatisfiability. One of common approaches is to identify minimal unsatisfiable subsets (MUSes) of the constraint set. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3d1cc811fa748162a6cc112fb28b3be
https://doi.org/10.1007/978-3-030-45190-5_8
https://doi.org/10.1007/978-3-030-45190-5_8
Autor:
Jaroslav Bendík, Ivana Černá
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030584740
CP
CP
In many areas of computer science, we are given an unsatisfiable Boolean formula F in CNF, i.e. a set of clauses, with the goal to identify minimal unsatisfiable subsets (MUSes) of F. The more MUSes are identified, the better insight into F’s unsat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8d22fcdaf4224962fe330c0be65c1b8
https://doi.org/10.1007/978-3-030-58475-7_3
https://doi.org/10.1007/978-3-030-58475-7_3
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 99:114-142
The parameter synthesis problem for timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for Cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e844479ccb2781ab150827d3643b7a9
https://doi.org/10.1016/j.jlamp.2018.05.004
https://doi.org/10.1016/j.jlamp.2018.05.004
Publikováno v:
Automated Technology for Verification and Analysis-16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Technology for Verification and Analysis
Automated Technology for Verification and Analysis ISBN: 9783030010898
ATVA
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Technology for Verification and Analysis
Automated Technology for Verification and Analysis ISBN: 9783030010898
ATVA
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 problems among them. Such cores are called minimal unsatisfiable subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4a2d9aba97a0000e54085381220ea08
Autor:
Ivana Černá, Jaroslav Bendík
Publikováno v:
EPiC Series in Computing volume 57
LPAR
LPAR
In many different applications we are given a set of constraints with the goal to decide whether the set is satisfiable. If the set is determined to be unsatisfiable, one might be interested in analysing this unsatisfiability. Identification of minim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63c066293e1f8e1c63f171df6f3b66ac