| 2010 | ||
|---|---|---|
| j4 | Parosh Aziz Abdulla, Pavel Krcál, Wang Yi: Sampled Semantics of Timed Automata. Logical Methods in Computer Science 6(3) (2010) | |
| 2009 | ||
| j3 | Parosh Aziz Abdulla, Pavel Krcál, Wang Yi: Universality of R-automata with Value Copying. Electr. Notes Theor. Comput. Sci. 239: 131-141 (2009) | |
| 2008 | ||
| c9 | ||
| 2007 | ||
| j2 | Elena Fersman, Pavel Krcál, Paul Pettersson, Wang Yi: Task automata: Schedulability, decidability and undecidability. Inf. Comput. 205(8): 1149-1172 (2007) | |
| c8 | Pavel Krcál, Martin Stigge, Wang Yi: Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times. FORMATS 2007: 274-289 | |
| c7 | Parosh Aziz Abdulla, Pavel Krcál, Wang Yi: Sampled Universality of Timed Automata. FoSSaCS 2007: 2-16 | |
| 2006 | ||
| c6 | ||
| 2005 | ||
| c5 | ||
| 2004 | ||
| c4 | Pavel Krcál, Leonid Mokrushin, P. S. Thiagarajan, Wang Yi: Timed vs. Time-Triggered Automata. CONCUR 2004: 340-354 | |
| c3 | Pavel Krcál, Wang Yi: Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata. TACAS 2004: 236-250 | |
| 2003 | ||
| j1 | Pavel Krcál: Distributed Explicit Bounded LTL Model Checking. Electr. Notes Theor. Comput. Sci. 89(1): 33-50 (2003) | |
| 2001 | ||
| c2 | Lubos Brim, Ivana Cerná, Pavel Krcál, Radek Pelánek: Distributed LTL Model Checking Based on Negative Cycle Detection. FSTTCS 2001: 96-107 | |
| c1 | 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 | |
| 1 | Parosh Aziz Abdulla | |
| 2 | Lubos Brim | |
| 3 | Ivana Cerná (Ivana Cerna) | |
| 4 | Elena Fersman | |
| 5 | Leonid Mokrushin | |
| 6 | Radek Pelánek | |
| 7 | Paul Pettersson | |
| 8 | Martin Stigge | |
| 9 | P. S. Thiagarajan | |
| 10 | Wang Yi 0001 |
Colors in the list of coauthors
Last update Fri May 24 13:50:04 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page