Editors:
Unique visibility, state-of-the-art survey,
fast-track conference proceedings
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6227)
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 2010.
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 (13 papers)
-
Front Matter
-
Back Matter
Keywords
- Action
- algebraic structures
- automata
- complexity
- finite state machines
- infinite state sy
- infinite state systems
- reachability problems
- temporal logics
- verification
Editors and Affiliations
-
Faculty of Informatics, Masaryk University, Brno, Czech Republic
Antonín Kučera
-
Department of Computer Science, University of Liverpool, Liverpool, England
Igor Potapov
Bibliographic Information
Book Title: Reachability Problems
Book Subtitle: 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings
Editors: Antonín Kučera, Igor Potapov
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-15349-5
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2010
Softcover ISBN: 978-3-642-15348-8Published: 18 August 2010
eBook ISBN: 978-3-642-15349-5Published: 21 August 2010
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 199
Number of Illustrations: 42 b/w illustrations
Topics: Programming Techniques, Software Engineering, Compilers and Interpreters, Computer Science Logic and Foundations of Programming, Formal Languages and Automata Theory