Ranko Lazic
Ranko Lazic
Department of Computer Science, University of Warwick
Verified email at - Homepage
Cited by
Cited by
LTL with the freeze quantifier and register automata
S Demri, R Lazić
ACM Transactions on Computational Logic (TOCL) 10 (3), 1-30, 2009
A semantic study of data independence with applications to model checking.
RS Lazic
University of Oxford, 1999
The reachability problem for Petri nets is not elementary
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
Journal of the ACM (JACM) 68 (1), 1-28, 2020
Nets with tokens which carry data
R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell
Fundamenta Informaticae 88 (3), 251-274, 2008
Alternating automata on data trees and XPath satisfiability
M Jurdziński, R Lazić
ACM Transactions on Computational Logic (TOCL) 12 (3), 19, 2011
On the freeze quantifier in constraint LTL: decidability and complexity
S Demri, R Lazić, D Nowak
Information and Computation 205 (1), 2-24, 2007
Succinct progress measures for solving parity games
M Jurdziński, R Lazić
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-9, 2017
Model checking freeze LTL over one-counter automata
S Demri, R Lazić, A Sangnier
Foundations of Software Science and Computational Structures: 11th …, 2008
The covering and boundedness problems for branching vector addition systems
S Demri, M Jurdziński, O Lachish, R Lazić
Journal of Computer and System Sciences 79 (1), 23-38, 2013
A unifying approach to data-independence
R Lazić, D Nowak
CONCUR 2000—Concurrency Theory: 11th International Conference University …, 2000
Fixed-dimensional energy games are in pseudo-polynomial time
M Jurdziński, R Lazić, S Schmitz
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
Nonelementary complexities for branching VASS, MELL, and extensions
R Lazić, S Schmitz
ACM Transactions on Computational Logic (TOCL) 16 (3), 1-30, 2015
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Safety alternating automata on data words
R Lazić
ACM Transactions on Computational Logic (TOCL) 12 (2), 10, 2011
Data-abstraction refinement: A game semantic approach
A Dimovski, DR Ghica, R Lazić
Static Analysis: 12th International Symposium, SAS 2005, London, UK …, 2005
Reachability in two-dimensional unary vector addition systems with states is NL-complete
M Englert, R Lazić, P Totzke
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
What makes Petri nets harder to verify: stack or data?
R Lazić, P Totzke
Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William …, 2017
The ideal view on Rackoff’s coverability technique
R Lazić, S Schmitz
Reachability Problems: 9th International Workshop, RP 2015, Warsaw, Poland …, 2015
On model checking data-independent systems with arrays without reset
RS Lazić, TC Newcomb, AW Roscoe
Theory and Practice of Logic Programming 4 (5-6), 659-693, 2004
Data Independence with Generalised Predicate Symbols.
R Lazic, B Roscoe
PDPTA 99, 319-325, 1999
The system can't perform the operation now. Try again later.
Articles 1–20