Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5797)
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 2009.
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
- Permutation
- algebraic structures
- algorithms
- automata
- calculus
- computational models
- hyprid systems
- infinite state systems
- information theory
- logic
- petri nets
- reachability problems
- rewriting systems
- verification
- algorithm analysis and problem complexity
Editors and Affiliations
-
Ecole Polytechnique, Laboratoire d’ Informatique (LIX), Palaiseau Cedex, France
Olivier Bournez
-
Department of Computer Science, Ashton Building, University of Liverpool, Liverpool, England
Igor Potapov
Bibliographic Information
Book Title: Reachability Problems
Book Subtitle: Third International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings
Editors: Olivier Bournez, Igor Potapov
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-04420-5
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2009
Softcover ISBN: 978-3-642-04419-9Published: 07 September 2009
eBook ISBN: 978-3-642-04420-5Published: 27 August 2009
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 233
Topics: Mathematics of Computing, Theory of Computation, Programming Techniques, Algorithms, Computer Science Logic and Foundations of Programming