Mojmír Křetínský
Mojmír Křetínský
Masaryk university, Faculty of Informatics
E-mailová adresa ověřena na: fi.muni.cz - Domovská stránka
Název
Citace
Citace
Rok
LTL to Büchi Automata Translation: Fast and More Deterministic
T Babiak, M Křetínský, V Řehák, J Strejček
TACAS 2012: 18th International Conference on Tools and Algorithms for the …, 2012
1402012
Effective translation of LTL to deterministic Rabin automata: Beyond the (F, G)-fragment
T Babiak, F Blahoudek, M Křetínský, J Strejček
Automated Technology for Verification and Analysis, 24-39, 2013
452013
Compositional approach to suspension and other improvements to LTL translation
T Babiak, T Badie, A Duret-Lutz, M Křetínský, J Strejček
International SPIN Workshop on Model Checking of Software, 81-98, 2013
302013
Extended process rewrite systems: Expressiveness and reachability
M Křetínský, V Řehák, J Strejček
International Conference on Concurrency Theory, 355-370, 2004
292004
On decidability of LTL model checking for process rewrite systems
L Bozzelli, M Křetínský, V Řehák, J Strejček
Acta informatica 46 (1), 1-28, 2009
212009
A process algebra for synchronous concurrent constraint programming
L Brim, JM Jacquet, D Gilbert, M Křetínský
International Conference on Algebraic and Logic Programming, 165-178, 1996
211996
Formal Languages and Automata I
I Černá, M Křetínský, A Kučera
Brno: Masarykova univerzita, 2006
20*2006
Comparison of LTL to deterministic Rabin automata translators
F Blahoudek, M Křetínský, J Strejček
International Conference on Logic for Programming Artificial Intelligence …, 2013
192013
Comparing expressibility of normed BPA and normed BPP processes
I Černá, M Křetínsky, A Kučera
Acta informatica 36 (3), 233-256, 1999
171999
Seminator: A Tool for Semi-Determinization of Omega-Automata
F Blahoudek, A Duret-Lutz, M Klokocka, M Kretínský, J Strejcek
International Conference on Logic for Programming Artificial Intelligence …, 2017
132017
Reachability of Hennessy-Milner properties for weakly extended PRS
M Křetínský, V Řehák, J Strejček
International Conference on Foundations of Software Technology and …, 2005
132005
On extensions of process rewrite systems: Rewrite systems with weak finite-state unit
M Křetı́nský, V Rehák, J Strejček
Electronic Notes in Theoretical Computer Science 98, 75-88, 2004
132004
New Versions of Ask and Tell for Synchronous Communication in Concurrent Constraint Programming
L Brim, D Gilbert, M Kretinsky, J Jacquet
111996
Formální jazyky a automaty I
I Černá, M Křetínský, A Kučera
Elportál, 2006
102006
Is there a best Büchi automaton for explicit model checking?
F Blahoudek, A Duret-Lutz, M Křetínský, J Strejček
Proceedings of the 2014 International SPIN Symposium on Model Checking of …, 2014
82014
Synchronisation in Scc
L Brim, D Gilbert, JM Jacquet, M Křetínský
ILPS 95, 282-283, 0
7
Reachability is decidable for weakly extended process rewrite systems
M Křetínský, V Řehák, J Strejček
Information and Computation 207 (6), 671-680, 2009
52009
Multi-agent systems as concurrent constraint processes
L Brim, D Gilbert, JM Jacquet, M Křetíynskí
SOFSEM 2001: Theory and Practice of Informatics, 201-210, 2001
52001
Refining the undecidability border of weak bisimilarity
M Kretínský, V Rehák, J Strejček
IN PROCEEDINGS OF THE 7TH INTERNATIONAL WORKSHOP ON VERIFICATION OF INFINITE …, 2006
42006
Automaty a formálnı jazyky I
I Cerná, M Kretınský, A Kucera
Ucebnı text, verze 1, 2002
42002
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20