Pavel Krcál

According to our database1, Pavel Krcál authored at least 17 papers between 2001 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Various Ways to Quantify BDMPs.
Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems, 2020

2016
Effective Static and Dynamic Fault Tree Analysis.
Proceedings of the Computer Safety, Reliability, and Security, 2016

2015
Scalable Analysis of Fault Trees with Dynamic Features.
Proceedings of the 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2015

2010
Sampled Semantics of Timed Automata
Log. Methods Comput. Sci., 2010

2009
Infinite Structures in Timed Systems.
PhD thesis, 2009

Universality of R-automata with Value Copying.
Proceedings of the Joint Proceedings of the 8th, 2009

2008
R-Automata.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Task automata: Schedulability, decidability and undecidability.
Inf. Comput., 2007

Sampled Universality of Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007

2006
Communicating Timed Automata: The More Synchronous, the More Difficult to Verify.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005
On Sampled Semantics of Timed Systems.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Timed vs. Time-Triggered Automata.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Distributed Explicit Bounded LTL Model Checking.
Proceedings of the 2nd International Workshop on Parallel and Distributed Model Checking, 2003

2001
How to Employ Reverse Search in Distributed Single Source Shortest Paths.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Distributed LTL Model Checking Based on Negative Cycle Detection.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001


  Loading...