2008 |
11 | EE | Parosh Aziz Abdulla,
Pavel Krcál,
Wang Yi:
R-Automata.
CONCUR 2008: 67-81 |
2007 |
10 | EE | Pavel Krcál,
Martin Stigge,
Wang Yi:
Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times.
FORMATS 2007: 274-289 |
9 | EE | Parosh Aziz Abdulla,
Pavel Krcál,
Wang Yi:
Sampled Universality of Timed Automata.
FoSSaCS 2007: 2-16 |
8 | EE | Elena Fersman,
Pavel Krcál,
Paul Pettersson,
Wang Yi:
Task automata: Schedulability, decidability and undecidability.
Inf. Comput. 205(8): 1149-1172 (2007) |
2006 |
7 | EE | Pavel Krcál,
Wang Yi:
Communicating Timed Automata: The More Synchronous, the More Difficult to Verify.
CAV 2006: 249-262 |
2005 |
6 | EE | Pavel Krcál,
Radek Pelánek:
On Sampled Semantics of Timed Systems.
FSTTCS 2005: 310-321 |
2004 |
5 | EE | Pavel Krcál,
Leonid Mokrushin,
P. S. Thiagarajan,
Wang Yi:
Timed vs. Time-Triggered Automata.
CONCUR 2004: 340-354 |
4 | EE | Pavel Krcál,
Wang Yi:
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata.
TACAS 2004: 236-250 |
2003 |
3 | EE | Pavel Krcál:
Distributed Explicit Bounded LTL Model Checking.
Electr. Notes Theor. Comput. Sci. 89(1): (2003) |
2001 |
2 | EE | Lubos Brim,
Ivana Cerná,
Pavel Krcál,
Radek Pelánek:
Distributed LTL Model Checking Based on Negative Cycle Detection.
FSTTCS 2001: 96-107 |
1 | EE | Lubos Brim,
Ivana Cerná,
Pavel Krcál,
Radek Pelánek:
How to Employ Reverse Search in Distributed Single Source Shortest Paths.
SOFSEM 2001: 191-200 |