prof. RNDr. Jan Strejček, Ph.D.
Professor, Department of Computer Science
Office: C414
Botanická 554/68a
602 00 Brno
Phone: | +420 549 49 6941 |
---|---|
E‑mail: |
social and academic networks: |
---|
Total number of publications: 86
2009
-
Reachability is decidable for weakly extended process rewrite systems
Information and Computation, year: 2009, volume: 207, edition: 6
2008
-
Petri Nets Are Less Expressive Than State-Extended PA
Theoretical Computer Science, year: 2008, volume: 394, edition: 1-2
2007
-
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Year: 2007, type: Appeared in Conference without Proceedings
-
On Symbolic Verification of Weakly Extended PAD
Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EXPRESS 2006), year: 2007
2006
-
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, year: 2006
-
On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems
Year: 2006, type: R&D Presentation
-
On Symbolic Verification of Weakly Extended PAD
Preliminary Proceedings - 13th International Workshow on Expressiveness in Concurrency - EXPRESS'06, year: 2006
-
Refining Undecidability Border of Weak Bisimilarity.
Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05), year: 2006
2005
-
Deeper Connections between LTL and Alternating Automata
Implementation and Application of Automata, year: 2005
-
Characteristic Patterns for LTL
SOFSEM 2005: Theory and Practice of Computer Science, year: 2005