| Task automata: Schedulability, decidability and undecidability E Fersman, P Krcal, P Pettersson, W Yi Information and Computation 205 (8), 1149-1172, 2007 | 214 | 2007 |
| Distributed LTL model checking based on negative cycle detection L Brim, I Černá, P Krčál, R Pelánek International Conference on Foundations of Software Technology and …, 2001 | 97 | 2001 |
| Decidable and undecidable problems in schedulability analysis using timed automata P Krčál, W Yi International Conference on Tools and Algorithms for the Construction and …, 2004 | 71 | 2004 |
| Communicating timed automata: the more synchronous, the more difficult to verify P Krcál, W Yi Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006 | 48 | 2006 |
| Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times P Krcal, M Stigge, W Yi Formal Modeling and Analysis of Timed Systems: 5th International Conference …, 2007 | 34 | 2007 |
| On sampled semantics of timed systems P Krčál, R Pelánek International Conference on Foundations of Software Technology and …, 2005 | 33 | 2005 |
| Timed vs. time-triggered automata P Krčál, L Mokrushin, PS Thiagarajan, W Yi CONCUR 2004-Concurrency Theory: 15th International Conference, London, UK …, 2004 | 30 | 2004 |
| R-automata PA Abdulla, P Krcal, W Yi CONCUR 2008-Concurrency Theory: 19th International Conference, CONCUR 2008 …, 2008 | 22 | 2008 |
| Scalable analysis of fault trees with dynamic features J Krcál, P Krcál 2015 45th Annual IEEE/IFIP international conference on dependable systems …, 2015 | 20 | 2015 |
| Sampled semantics of timed automata P Krcal, PA Abdulla, W Yi Logical Methods in Computer Science 6, 2010 | 18 | 2010 |
| Effective static and dynamic fault tree analysis O Bäckström, Y Butkova, H Hermanns, J Krčál, P Krčál Computer Safety, Reliability, and Security: 35th International Conference …, 2016 | 17 | 2016 |
| Distributed shortest paths for directed graphs with negative edge lengths L Brim, I Cerna, P Krcal, R Pelanek Technical Report FIMU-RS-2001–01, Faculty of Informatics, Masaryk University …, 2001 | 15 | 2001 |
| A tool for compositional analysis of timed systems by abstraction P Krcál, L Mokrushin, W Yi Proceedings of 19th Nordic workshop on programming theory (NWPT07), 2007 | 13 | 2007 |
| Model checking in IPv6 Hardware Router Design J Barnat, T Brázdil, P Krčál, V Řehák, D Šafránek CESNET technical report 8, 2002 | 13 | 2002 |
| Distributed explicit bounded LTL model checking P Krčál Electronic notes in theoretical computer science 89 (1), 33-50, 2003 | 12 | 2003 |
| Sampled universality of timed automata PA Abdulla, P Krcal, W Yi Foundations of Software Science and Computational Structures: 10th …, 2007 | 10 | 2007 |
| Uppaal KG Larsen, W Yi, P Petterson, A David, B Nielsen, A Skou, J Håkansson, ... Uppsala University, Sweden and Aalborg University, Denmark.[Online …, 2015 | 9 | 2015 |
| Feasibility Study for Connection Between IDPSA and conventional PSA Approach to Analysis of. Nordic type BWR's P Kudinov, S Galushin, S Raub, VA Phung, K Kööp, I Karanta, T Silvonen, ... NKS-DPSA Project, NKS-R, Report: NKS-315, 2014 | 9 | 2014 |
| Various ways to quantify BDMPs M Bouissou, S Khan, JP Katoen, P Krcal arXiv preprint arXiv:2004.13283, 2020 | 8 | 2020 |
| Introduction and Demonstration of the I&AB Quantification Method as Implemented with RiskSpectrum PSA O Bäckström, M Bouissou, R Gamble, P Krcal, J Sörman, W Wang Proceedings of PSAM 14, 2018 | 6 | 2018 |