Complexity of Checking Bisimilarity between Sequential and Parallel Processes.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Using Uppaal for Verification of Priority Assignment in Real-Time Databases.
Proceedings of the Digital Information Processing and Communications, 2011
Complexity of deciding bisimilarity between normed BPA and normed BPP.
Inf. Comput., 2010
Modeling and Verification of Priority Assignment in Real-Time Databases Using Uppaal.
Proceedings of the Dateso 2010 Annual International Workshop on DAtabases, 2010
Modeling selected real-time database concurrency control protocols in Uppaal.
Innov. Syst. Softw. Eng., 2009
Modeling real-time database concurrency control protocol two-phase-locking in Uppaal.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2008
Normed BPA vs. Normed BPP Revisited.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time.
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004