Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8762)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: RP 2014.
Buy print copy
About this book
Similar content being viewed by others
Keywords
- Petri nets
- automata theory
- communicating automata
- computational aspects of semigroups, groups, and rings
- computational complexity
- decidable and undecidable reachability problems
- dynamical and hybrid systems
- formal languages
- formal methods
- infinite state systems
- prdictability in iterative maps
- program analysis
- reachability analysis
- rewrite systems
- rewriting systems
- software system models
- theory of computation
- timed automata
Table of contents (18 papers)
Other volumes
-
Reachability Problems
Editors and Affiliations
Bibliographic Information
Book Title: Reachability Problems
Book Subtitle: 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings
Editors: Joël Ouaknine, Igor Potapov, James Worrell
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-11439-2
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2014
Softcover ISBN: 978-3-319-11438-5Published: 23 September 2014
eBook ISBN: 978-3-319-11439-2Published: 15 September 2014
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XX, 246
Number of Illustrations: 59 b/w illustrations
Topics: Computation by Abstract Devices, Logics and Meanings of Programs, Software Engineering, Programming Languages, Compilers, Interpreters, Mathematical Logic and Formal Languages, Coding and Information Theory