Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="K{\v{r}}et{\'{i}}nsk{\'y}, Mojm{\'{i}}r"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On decidability of LTL model checking for process rewrite systems
Laura Bozzelli
,
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Acta Informatica
46
(1), 2009, pp. 1-28
Reachability is decidable for weakly extended process rewrite systems
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Information and Computation
207
(6), 2009, pp. 671-680
Petri nets are less expressive than state-extended PA
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Theoretical Computer Science
394
(1-2), 2008, pp. 134-140
On decidability of LTL model checking for process rewrite systems
Laura Bozzelli
,
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Lecture Notes in Computer Science
4337
, 2006, pp. 248-259
Reachability of Hennessy-Milner properties for weakly extended PRS
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Lecture Notes in Computer Science
3821
, 2005, pp. 213-224
Comparing expressibility of normed BPA and normed BPP processes
Ivana C̑erná
,
Mojmír Kȓetínský
,
Antonín Kuc̑era
Acta Informatica
36
(3), 1999, pp. 233-256