bokomslag Reachability Problems
Data & IT

Reachability Problems

Giorgio Delzanno Igor Potapov

Pocket

769:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 245 sidor
  • 2011
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.
  • Författare: Giorgio Delzanno, Igor Potapov
  • Format: Pocket/Paperback
  • ISBN: 9783642242878
  • Språk: Engelska
  • Antal sidor: 245
  • Utgivningsdatum: 2011-09-19
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K