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.
Genres
- Computer simulation
- Computers
- Decidability (mathematical logic)
- Configurations
- System theory
- Operating systems (computers)
- Computer science, mathematics
- Computer systems
- Congresses
- Verification
- Computer science
- Mathematics
- Engineering & Applied Sciences
- Software engineering
- Coding theory
- Logic design
- Computation by Abstract Devices
- Logics and Meanings of Programs
- Programming Languages, Compilers, Interpreters
- Mathematical Logic and Formal Languages
- Coding and Information Theory
- Computer software
- Algorithm Analysis and Problem Complexity
0
people already read
0
people are currently reading
2
people want to read
About the authors
