Pavel Krcál - RankMe

18 papers A* 1A 2B 5Journal 2Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	—	`book`	Concise Guide to Fault Tree Analysis - Models, Methods and Algorithms Mariëlle Stoelinga, Enno Ruijters, Pavel Krcál
2020	—	`conf`	Various Ways to Quantify BDMPs. MARS Marc Bouissou, Shahid Khan, Joost-Pieter Katoen, Pavel Krcál
2016	B	`conf`	Effective Static and Dynamic Fault Tree Analysis. SAFECOMP Ola Bäckström, Yuliya Butkova, Holger Hermanns, Jan Krcál, Pavel Krcál
2015	A	`conf`	Scalable Analysis of Fault Trees with Dynamic Features. DSN Jan Krcál, Pavel Krcál
2010	J	`jnl`	Sampled Semantics of Timed Automata Log. Methods Comput. Sci. Parosh Aziz Abdulla, Pavel Krcál, Wang Yi
2009	—	`—`	Infinite Structures in Timed Systems. Pavel Krcál
2009	—	`conf`	Universality of R-automata with Value Copying. INFINITY Parosh Aziz Abdulla, Pavel Krcál, Wang Yi
2008	B	`conf`	R-Automata. CONCUR Parosh Aziz Abdulla, Pavel Krcál, Wang Yi
2007	—	`conf`	Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times. FORMATS Pavel Krcál, Martin Stigge, Wang Yi
2007	B	`conf`	Sampled Universality of Timed Automata. FoSSaCS Parosh Aziz Abdulla, Pavel Krcál, Wang Yi
2007	J	`jnl`	Task automata: Schedulability, decidability and undecidability. Inf. Comput. Elena Fersman, Pavel Krcál, Paul Pettersson, Wang Yi
2006	A*	`conf`	Communicating Timed Automata: The More Synchronous, the More Difficult to Verify. CAV Pavel Krcál, Wang Yi
2005	—	`conf`	On Sampled Semantics of Timed Systems. FSTTCS Pavel Krcál, Radek Pelánek
2004	A	`conf`	Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata. TACAS Pavel Krcál, Wang Yi
2004	B	`conf`	Timed vs. Time-Triggered Automata. CONCUR Pavel Krcál, Leonid Mokrushin, P. S. Thiagarajan, Wang Yi
2003	—	`conf`	Distributed Explicit Bounded LTL Model Checking. PDMC@CAV Pavel Krcál
2001	—	`conf`	Distributed LTL Model Checking Based on Negative Cycle Detection. FSTTCS Lubos Brim, Ivana Cerná, Pavel Krcál, Radek Pelánek
2001	B	`conf`	How to Employ Reverse Search in Distributed Single Source Shortest Paths. SOFSEM Lubos Brim, Ivana Cerná, Pavel Krcál, Radek Pelánek