appearance

MU › FI › About the faculty › People Search at MU › Personal page › Publications

Masaryk University - Faculty of Informatics

Skip navigation

Skip the Organizational structure panel
Organizational structure
On selecting a constituent part of MU the "Staff" page will be displayed with information relevant to the selected constituent part. The "Staff" page is not available for non-activated items.

Masaryk University
- Faculties
- Law
- Medicine
- Science
- Arts
- Education
- Economics
- Informatics
- Social Studies
- Sports Studies
- Institutes
- Computer Science
- CEITEC MU
- Politica
- Specialized Units
- Hostels & Canteens
- University Press
- Telč Centre
- UCB Management
- Rector`s Office
- Rectorate
- Other Units
- Archive
- Language Centre
- International Studies
- Disabled Students
- Technology Transfer
- Biostatistics
- Mendel Museum
- CERIT
- Civic Education
- Project Team CEITEC

Faculty of Informatics

RNDr. Jan Strejček, Ph.D.

Basic CV Supervisor Qualifications Publications Projects Teaching

2012

Almost linear Büchi automata

BABIAK, Tomáš - STREJČEK, Jan - ŘEHÁK, Vojtěch.
Almost linear Büchi automata. Mathematical Structures in Computer Science, Cambridge, Cambridge University Press, Great Britain. ISSN 0960-1295, 2012, vol. 22, no. 02, pp. 203-235.

LTL to Büchi Automata Translation: Fast and More Deterministic

BABIAK, Tomáš - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
LTL to Büchi Automata Translation: Fast and More Deterministic. In TACAS 2012: 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Berlin, Heidelberg : Springer-Verlag, 2012. ISBN 978-3-642-28755-8, pp. 95-109. 2012, Tallinn, Estonia.

2010

Almost Linear Büchi Automata

BABIAK, Tomáš - STREJČEK, Jan - ŘEHÁK, Vojtěch.
Almost Linear Büchi Automata. 2010.

Decidable Race Condition and Open Coregions in HMSC

ŘEHÁK, Vojtěch - SLOVÁK, Petr - STREJČEK, Jan - HÉLOUËT, Loic.
Decidable Race Condition and Open Coregions in HMSC. In Proceedings of the Ninth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010). Paphos, Kypr : ECEASST, 2010. 12 pp. 2010, Paphos, Kypr.

Young Researchers Forum

STREJČEK, Jan.
Young Researchers Forum. 2010. CZE, Fakulta informatiky MU, Brno. 21.8.2010 - 22.8.2010, Worldwide Activity.

2009

Almost Linear Büchi Automata

BABIAK, Tomáš - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Almost Linear Büchi Automata. In Proceedings 16th International Workshop on Expressiveness in Concurrency 2009 (EXPRESS'09). Vyd. 1st ed. internet : EPTCS, 2009. pp. 16-25. 2009, Bologna, Italia.

On Decidability of LTL Model Checking for Process Rewrite Systems

BOZZELLI, Laura - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL Model Checking for Process Rewrite Systems. Acta informatica, Berlin, Springer-Verlag, Germany. ISSN 0001-5903, 2009, vol. 46, no. 1, pp. 1-28. DOI: 10.1007/s00236-008-0082-3.

On Decidability of LTL+Past Model Checking for Process Rewrite Systems

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL+Past Model Checking for Process Rewrite Systems. In Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems (INFINITY 2006, 2007, 2008). Vyd. 2009. Amsterdam, The Netherlands : Elsevier Science Publishers, 2009. pp. 105-117. 2007, Lisbon, Portugal.

Reachability is decidable for weakly extended process rewrite systems

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Reachability is decidable for weakly extended process rewrite systems. Information and Computation, Elsevier, The Nederlands. ISSN 0890-5401, 2009, vol. 207, no. 6, pp. 671-680.

2008

Petri Nets Are Less Expressive Than State-Extended PA

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Petri Nets Are Less Expressive Than State-Extended PA. Theoretical Computer Science, Amsterdam, North Holland, Elsevier Science Publishers, The Nederlands. ISSN 0304-3975, 2008, vol. 394, no. 1-2, pp. 134-140. DOI 10.1016/j.tcs.2007.12.003.

2007

On Decidability of LTL+Past Model Checking for Process Rewrite Systems

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL+Past Model Checking for Process Rewrite Systems. 2007.

On Symbolic Verification of Weakly Extended PAD

BOUAJJANI, Ahmed - STREJČEK, Jan - TOUILI, Tayssir.
On Symbolic Verification of Weakly Extended PAD. In Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EXPRESS 2006). Neuveden : Elsevier, 2007. pp. 47-64. 26.8.2006, Bonn, Německo.

2006

On Decidability of LTL Model Checking for Process Rewrite Systems

BOZZELLI, Laura - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL Model Checking for Process Rewrite Systems. In FSTTCS 2006: 26th International Conference on Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings. Berlin : Springer-Verlag, 2006. ISBN 978-3-540-49994-7, pp. 248-259. 2006, Kolkata, India. Lecture Notes in Computer Science 4337.

On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems

BOZZELLI, Laura - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems. Brno : FI MU, 2006. FIMU-RS-2006-05. full and extended version of FST&TCS'06 paper. link to a new window WWW

On Symbolic Verification of Weakly Extended PAD

BOUAJJANI, Ahmed - STREJČEK, Jan - TOUILI, Tayssir.
On Symbolic Verification of Weakly Extended PAD. In Preliminary Proceedings - 13th International Workshow on Expressiveness in Concurrency - EXPRESS'06. London : Imperial College London, 2006. pp. 29-41. 26.8.2006, Bonn, Germany.

Refining Undecidability Border of Weak Bisimilarity.

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Refining Undecidability Border of Weak Bisimilarity. In Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05). Vyd. 2006. Amsterdam, The Netherlands : Elsevier Science, 2006. pp. 17-36. 2005, San Francisco, USA. modified and extended version of INFINITY 2005 paper.

2005

Deeper Connections between LTL and Alternating Automata

PELÁNEK, Radek - STREJČEK, Jan.
Deeper Connections between LTL and Alternating Automata. In Implementation and Application of Automata. Berlin, Heidelberg : Springer-Verlag, 2005. ISBN 978-3-540-31023-5, pp. 238-249. 2005, Sophia Antipolis.

Characteristic Patterns for LTL

KUČERA, Antonín - STREJČEK, Jan.
Characteristic Patterns for LTL. In SOFSEM 2005: Theory and Practice of Computer Science. Berlin, Heidelberg : Springer-Verlag, 2005. ISBN 3-540-24302-X, pp. 239-249. 2005, Liptovský Ján, Slovakia.

Linear Temporal Logic: Expressiveness and Model Checking

STREJČEK, Jan.
Linear Temporal Logic: Expressiveness and Model Checking. Faculty of Informatics, Masaryk University, 2005. 148 pp. Ph.D. Thesis.

Reachability Analysis of Multithreaded Software with Asynchronous Communication

BOUAJJANI, Ahmed - ESPARZA, Javier - SCHWOON, Stefan - STREJČEK, Jan.
Reachability Analysis of Multithreaded Software with Asynchronous Communication. In FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference. Berlin, Heidelberg : Springer-Verlag, 2005. ISBN 3-540-30495-9, pp. 348-359. 2005, Hyderabad, India.

Reachability of Hennessy - Milner properties for weakly extended PRS

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Reachability of Hennessy - Milner properties for weakly extended PRS. In FSTTCS 2005: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, 25th International Conference. Berlin, Heidelberg : Springer-Verlag, 2005. ISBN 3-540-30495-9, pp. 213-224. 2005, Hyderabad, India.

Refining Undecidability Border of Weak Bisimilarity.

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Refining Undecidability Border of Weak Bisimilarity. BRICS Notes Series, San Francisco, USA, . ISSN 0909-3206, 2005, vol. 2005, no. NS-05-4, pp. 3-14.

Refining Undecidability Border of Weak Bisimilarity. (full version of INFINITY 2005 paper)

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Refining Undecidability Border of Weak Bisimilarity. (full version of INFINITY 2005 paper). Brno : FI MU, 2005. FIMU-RS-2005-06. link to a new window WWW

The stuttering principle revisited

KUČERA, Antonín - STREJČEK, Jan.
The stuttering principle revisited. Acta informatica, Berlin, Springer-Verlag, Germany. ISSN 0001-5903, 2005, vol. 41, no. 7/8, pp. 415-434.

2004

Extended Process Rewrite Systems: Expressiveness and Reachability

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Extended Process Rewrite Systems: Expressiveness and Reachability. In CONCUR 2004 - Concurrency Theory. Vyd. LNCS 3170. Berlin, Heidelberg, New York : Springer, 2004. ISBN 3-540-22940-X, pp. 355-370. 2004, London, UK.

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. In INFINITY'2003: 5th International Workshop on Verification of Infinite-State Systems. Vyd. 2004. Amsterdam, The Netherlands : Elsevier Science, 2004. pp. 75-88. 2003, Marseilles, France.

On the Expressive Power of Extended Process Rewrite Systems

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On the Expressive Power of Extended Process Rewrite Systems. BRICS Report Series, Aarhus, Basic Research in Computer Science. ISSN 0909-0878, 2004, vol. 2004, no. RS-04-7, pp. 1-18.

2003

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. In Prelim.Proc.of the 5th Internat.Workshop on Verification of Infinite-State Systems (INFINITY'2003). Marseille, France : Universite de Provence, Marseille, 2003. pp. 73-86. 2003, Marseille.

Process Rewrite Systems with Weak Finite-State Unit (full version of INFINITY'2003 paper)

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Process Rewrite Systems with Weak Finite-State Unit (full version of INFINITY'2003 paper). Brno : FI MU, 2003. 23 pp. FIMU-RS-2003-05.

2002

Boundaries and Efficiency of Verification

STREJČEK, Jan.
Boundaries and Efficiency of Verification. In Proceedings of summer school MOVEP~2002. Nantes (France) : IRCCyN, Ecole Centrale de Nantes, France, 2002. pp. 403-408. 2002, 17.-21. 6. 2002, Nantes (France).

The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL

KUČERA, Antonín - STREJČEK, Jan.
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02). Berlin : Springer, 2002. ISBN 3-540-44240-5, pp. 276-291. 2002, September 22-25, 2002, Edinburgh, Scotland.

YAHODA: verification tools database

CRHOVÁ, Jitka - KRČÁL, Pavel - STREJČEK, Jan - ŠAFRÁNEK, David - ŠIMEČEK, Pavel.
YAHODA: verification tools database. In Proceedings of Tools Day. Brno : FI MU, 2002. pp. 99-103. 2002, 24. 8. 2002, Brno, Czech Republic.

2001

Models of infinite-state systems with constraints

STREJČEK, Jan.
Models of infinite-state systems with constraints. Brno : 2001. iii, 44 pp.

Rewrite Systems with Constraints

STREJČEK, Jan.
Rewrite Systems with Constraints. In EXPRESS'01 the 8th International Workshop on Expressiveness in Concurrency. Aalborg (Denmark) : Elsevier Science, 2001. pp. 1-20. 20. 8. 2001, Aalborg, Denmark.

2000

Constrained Rewrite Transition Systems

STREJČEK, Jan.
Constrained Rewrite Transition Systems. Brno : FI MU, 2000. Report Series, FIMU-RS-2000-12. link to a new window WWW

top