|
|
|
|
| LEADER |
02544nmm a2200397 u 4500 |
| 001 |
EB000390375 |
| 003 |
EBX01000000000000000243428 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783642335129
|
| 100 |
1 |
|
|a Finkel, Alain
|e [editor]
|
| 245 |
0 |
0 |
|a Reachability Problems
|h Elektronische Ressource
|b 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings
|c edited by Alain Finkel, Jerome Leroux, Igor Potapov
|
| 250 |
|
|
|a 1st ed. 2012
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2012, 2012
|
| 300 |
|
|
|a XII, 149 p. 31 illus
|b online resource
|
| 505 |
0 |
|
|a Reachability problems in algebraic structures, computational models, hybrid systems, logic and verification -- Finite- and infinite-state concurrent systems -- Computational models -- Decision procedures
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Leroux, Jerome
|e [editor]
|
| 700 |
1 |
|
|a Potapov, Igor
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-33512-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-33512-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 40,151
|
| 520 |
|
|
|a This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games
|