Reachability Problems : Third International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings

Olivier Bournez

ISBN 10: 3642044190 / ISBN 13: 9783642044199

Published by Springer, Springer Spektrum, 2009

About this Item

Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the research papers presented at the 3rd International Workshop, RP 2009 held in Palaiseau, France, September 23-25, 2009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms.

Seller Inventory # 9783642044199

Bibliographic Details

• Title: Reachability Problems : Third International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings
• Publisher: Springer, Springer Spektrum
• Publication Date: 2009
• Language: English
• ISBN 10: 3642044190
• ISBN 13: 9783642044199
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 14D millimeters 235 millimeters width by 155 millimeters height by 14 millimeters depth
• Weight: 376 grams

About this title

Synopsis

This book constitutes the research papers presented at the 3rd International Workshop, RP 2009 held in Palaiseau, France, September 23-25, 2009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms.