Reachability Problems 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, Proceedings /
Reachability Problems 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, Proceedings / [electronic resource] :
edited by Parosh Aziz Abdulla, Igor Potapov.
- 1st ed. 2013.
- XII, 223 p. 60 illus. online resource.
- Theoretical Computer Science and General Issues, 8169 2512-2029 ; .
- Theoretical Computer Science and General Issues, 8169 .
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.
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.
9783642410369
10.1007/978-3-642-41036-9 doi
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.
Algorithms.
Theory of Computation.
QA75.5-76.95
004.0151
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.
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.
9783642410369
10.1007/978-3-642-41036-9 doi
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.
Algorithms.
Theory of Computation.
QA75.5-76.95
004.0151