1 option
Reachability Problems : 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, Proceedings / edited by Parosh Aziz Abdulla, Igor Potapov.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8169
- Theoretical Computer Science and General Issues, 2512-2029 ; 8169
- Language:
- English
- Subjects (All):
- Computer science.
- Software engineering.
- Machine theory.
- Compilers (Computer programs).
- Algorithms.
- Computer Science Logic and Foundations of Programming.
- Software Engineering.
- Formal Languages and Automata Theory.
- Compilers and Interpreters.
- Theory of Computation.
- Local Subjects:
- Computer Science Logic and Foundations of Programming.
- Software Engineering.
- Formal Languages and Automata Theory.
- Compilers and Interpreters.
- Algorithms.
- Theory of Computation.
- Physical Description:
- 1 online resource (XII, 223 pages) : 60 illustrations
- Edition:
- 1st ed. 2013.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite state systems; rewriting systems, reachability analysis in counter/timed/cellular/communicating automata; Petri-nets; computational aspects of semigroups, groups and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects, predictability in iterative maps and new computational paradigms.
- Contents:
- Reachability for finite state systems
- Rewriting systems, reachability analysis in counter/timed/cellular/communicating automata
- Petri-nets
- Computational aspects of semigroups, groups and rings
- Reachability in dynamical and hybrid systems
- Frontiers between decidable and undecidable reachability problems
- Complexity and decidability aspects, predictability in iterative maps and new computational paradigms.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-41036-9
- 9783642410369
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.