Editors:
Up-to-date results
Fast-track conference proceedings
State-of-the-art research
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6945)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): RP: International Conference on Reachability Problems
Conference proceedings info: RP 2011.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (20 papers)
-
Front Matter
About this book
Keywords
- algorithms
- cellular automata
- computational complexity
- real-time systems
- timed automata
- algorithm analysis and problem complexity
Editors and Affiliations
-
Dipartimento di Informatica e Scienze dell’Informazione, Università di Genova, Genoa, Italy
Giorgio Delzanno
-
Department of Computer Science, University of Liverpool, Liverpool, UK
Igor Potapov
Bibliographic Information
Book Title: Reachability Problems
Book Subtitle: 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011, Proceedings
Editors: Giorgio Delzanno, Igor Potapov
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-24288-5
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag GmbH Berlin Heidelberg 2011
Softcover ISBN: 978-3-642-24287-8Published: 19 September 2011
eBook ISBN: 978-3-642-24288-5Published: 25 September 2011
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 245
Topics: Computer Science Logic and Foundations of Programming, Software Engineering, Formal Languages and Automata Theory, Compilers and Interpreters, Algorithms, Theory of Computation