Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Browse by Warwick Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 10.

Demri, Stéphane P., 1967-, Jurdzinski, Marcin, Lachish, Oded and Lazic, Ranko (2012) The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences . ISSN 0022-0000 (In Press)

Jurdzinski, Marcin and Lazic, Ranko. (2011) Alternating automata on data trees and XPath satisfiability. ACM Transactions on Computational Logic (TOCL), Vol.12 (No.3). pp. 1-21. ISSN 1529-3785

Lazic, Ranko. (2011) Safety alternating automata on data words. ACM Transactions on Computational Logic (TOCL), Vol.12 (No.2). pp. 1-24. ISSN 1529-3785

Bakewell, Adam, Dimovski, Aleksandar, Ghica, Dan R. and Lazic, Ranko. (2010) Data-abstraction refinement : a game semantic approach. International Journal on Software Tools for Technology Transfer, Vol.12 (No.5). pp. 373-389. ISSN 1433-2779

Lazic, Ranko. (2010) The reachability problem for branching vector addition systems requires doubly-exponential space. Information Processing Letters, Vol.110 (No.17). pp. 740-745. ISSN 0020-0190

Demri, Stéphane P., 1967-, Lazic, Ranko and Sangnier, Arnaud. (2010) Model checking memoryful linear-time logics over one-counter automata. Theoretical Computer Science, Vol.411 (No.22-24). pp. 2298-2316. ISSN 0304-3975

Demri, Stéphane P., 1967- and Lazic, Ranko. (2009) LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic (TOCL), Vol.10 (No.3). p. 16. ISSN 1529-3785

Jurdzinski, Marcin, Lazic, Ranko and Rutkowski, Michał, Ph.D. (2009) Average-price-per-reward games on hybrid automata with strong resets. In: 10th International Conference on Verification, Model Checking, and Abstract Interpretation, Savannah, GA, January 18-20, 2009. Published in: Lecture Notes in Computer Science, Vol.5403 pp. 167-181.

Lazic, Ranko, Jurdzinski, Marcin and Rutkowski, Michał, Ph.D. (2009) Average-price-per-reward games on hybrid automata with strong resets. In: Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science (5403). London: Springer, pp. 167-181. ISBN 9783540938996

Lazic, Ranko, Newcomb, T., Ouaknine, Joel, Roscoe, A. W. (Andrew William) and Worrell, J.. (2008) Nets with tokens which carry data. Fundamenta Informaticae, Vol.88 (No.3). pp. 251-274. ISSN 0169-2968

This list was generated on Mon May 20 00:03:49 2013 BST.
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us