Mojmír Křetínský

Available identifiers

Publication	Date of Publication	Type
A process algebra for synchronous concurrent constraint programming	2017-01-19	Paper
On Decidability of LTL+Past Model Checking for Process Rewrite Systems	2015-03-19	Paper
Effective translation of LTL to deterministic Rabin automata: beyond the \((\mathrm F,\mathrm G)\)-fragment	2014-07-08	Paper
Comparison of LTL to Deterministic Rabin Automata Translators	2014-01-17	Paper
Refining the undecidability border of weak bisimilarity	2013-10-07	Paper
On extensions of process rewrite systems: rewrite systems with weak finite-state unit	2013-09-09	Paper
LTL to Büchi automata translation: fast and more deterministic	2012-06-29	Paper
Reachability is decidable for weakly extended process rewrite systems	2009-06-11	Paper
On decidability of LTL model checking for process rewrite systems	2009-03-26	Paper
On Decidability of LTL Model Checking for Process Rewrite Systems	2008-04-17	Paper
Petri nets are less expressive than state-extended PA	2008-04-15	Paper
Model-Checking Large Finite-State Systems and Beyond	2008-03-07	Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science	2006-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q4680178	2005-10-07	Paper
CONCUR 2004 - Concurrency Theory	2005-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4473985	2004-08-04	Paper
Comparing expressibility of normed BPA and normed BPP processes	1999-11-29	Paper
https://portal.mardi4nfdi.de/entity/Q4222869	1998-12-20	Paper

This page was built for person: Mojmír Křetínský