Jan Strejček

2009

Laura Bozzelli, Mojmír Křetínský, Vojtěch Řehák, and Jan Strejček:
On Decidability of LTL Model Checking for Process Rewrite Systems,
Acta informatica, 2009. [bibtex, url]

2007

Ahmed Bouajjani, Jan Strejček, and Tayssir Touili:
On Symbolic Verification of Weakly Extended PAD,
Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EXPRESS 2006), Elsevier, 2007, 47-64. [bibtex, url]

2006

Radek Pelánek and Jan Strejček:
Deeper Connections Between LTL and Alternating Automata,
Implementation and Application of Automata: 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers, Springer Berlin Heidelberg, 2006, 238–249. [bibtex, url]

Laura Bozzelli, Mojmír Křetínský, Vojtěch Řehák, and Jan Strejček:
On Decidability of LTL Model Checking for Process Rewrite Systems,
FSTTCS 2006: 26th International Conference on Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings, Springer-Verlag, 2006, 248-259. [bibtex]

2005

Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, and Jan Strejček:
Reachability Analysis of Multithreaded Software with Asynchronous Communication,
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science: 25th International Conference, Hyderabad, India, December 15-18, 2005. Proceedings, Springer Berlin Heidelberg, 2005, 348–359. [bibtex, url]

Mojmír Křetínský, Vojtěch Řehák, and Jan Strejček:
Reachability of Hennessy - Milner properties for weakly extended PRS,
FSTTCS 2005: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Springer-Verlag, 2005, 213-224. [bibtex]

Antonín Kučera and Jan Strejček:
The stuttering principle revisited,
Acta informatica, 2005. [bibtex]

2004

Mojmír Křetínský, Vojtěch Řehák, and Jan Strejček:
Extended Process Rewrite Systems: Expressiveness and Reachability,
CONCUR 2004 - Concurrency Theory, Springer, 2004, 355-370. [bibtex]

Jan Strejček:
Linear Temporal Logic: Expressiveness and Model Checking,
2004. [bibtex, pdf]

Mojmír Křetínský, Vojtěch Řehák, and Jan Strejček:
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit,
INFINITY’2003: 5th International Workshop on Verification of Infinite-State Systems, Elsevier Science, 2004, 75-88. [bibtex, url]

2002

Jan Strejček:
Boundaries and Efficiency of Verification,
Proceedings of summer school MOVEP~2002, IRCCyN, Ecole Centrale de Nantes, France, 2002, 403-408. [bibtex]

Antonín Kučera and Jan Strejček:
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL,
Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL’02), Springer, 2002, 276-291. [bibtex]

Antonín Kučera and Jan Strejček:
The Stuttering Principle Revisited: On the Expressiveness of Nested X and ⋃ Operators in the Logic LTL,
Computer Science Logic: 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL Edinburgh, Scotland, UK, September 22–25, 2002 Proceedings, Springer Berlin Heidelberg, 2002, 276–291. [bibtex, url]

Jitka Crhová, Pavel Krčál, Jan Strejček, David Šafránek, and Pavel Šimeček:
YAHODA: verification tools database,
Proceedings of Tools Day, FI MU, 2002, 99-103. [bibtex, url]

2001

Jan Strejček:
Models of Infinite-State Systems with Constraints,
Master’s Thesis, 2001. [bibtex, pdf, url]

Jan Strejček:
Rewrite Systems with Constraints,
EXPRESS’01 the 8th International Workshop on Expressiveness in Concurrency, Elsevier Science, 2001, 1-20. [bibtex, url]

2000

Jan Strejček:
Constrained Rewrite Transition Systems,
FI MU, 2000. [bibtex, pdf, url]