Reachability Problems : 5th International Workshop, Rp 2011, Genoa, Italy, September 28-30, 2011, Proceedings. Questo articolo non è disponibile.
Lingua: inglese
Editore: Springer, 2011
- Brossura
- Usato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Venditore con 5 stelle
Venditore AbeBooks dal 6 aprile 2009
Non disponibile
Brossura
Condizione: Usato - Come nuovo
EUR 64,44
Descrizione dell’articolo da parte del venditore
Unread book in perfect condition.
Codice articolo 14214889
- Titolo
- Reachability Problems : 5th International Workshop, Rp 2011, Genoa, Italy, September 28-30, 2011, Proceedings
- Autore
- Delzanno, Giorgio (EDT); Potapov, Igor (EDT)
- Editore
- Springer
- Anno di pubblicazione
- 2011
- Condizione
- As New
- Rilegatura
- Brossura
- Lingua
- inglese
- ISBN 10
- 3642242871
- ISBN 13
- 9783642242878
This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, R.P. 2011, held in Genoa, Italy, in September 2011. The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in 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.
"Riassunto" può appartenere a un’altra edizione di questo titolo.
Dalla quarta di copertina
This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011.
The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in 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 modelled as games.
The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in 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 modelled as games.
"Descrizione articolo" può appartenere a un’altra edizione di questo titolo.