| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465865703316 |
|
|
Titolo |
Reachability Problems [[electronic resource] ] : 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings / / edited by Alain Finkel, Jerome Leroux, Igor Potapov |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2012.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 149 p. 31 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 7550 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
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 |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
International conference proceedings. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and author index. |
|
|
|
|
|
|
Nota di contenuto |
|
Reachability problems in algebraic structures, computational models, hybrid systems, logic and verification -- Finite- and infinite-state concurrent systems -- Computational models -- Decision procedures. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
| |