Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26,

Reachability Problems

7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, Proceedings

Abdulla, Parosh Aziz, Potapov, Igor (Eds.)

2013, XII, 223 p. 60 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 

ISBN 978-3-642-41036-9

digitally watermarked, no DRM

The eBook version of this title will be available soon


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$72.00

(net) price for USA

ISBN 978-3-642-41035-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite state systems; rewriting systems, reachability analysis in counter/timed/cellular/communicating automata; Petri-nets; computational aspects of semigroups, groups and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects, predictability in iterative maps and new computational paradigms.

Content Level » Research

Keywords » algebraic structures - automata - computational models - hybrid systems - infinite state systems - petri nets - reachability problems - rewriting systems - verification

Related subjects » Software Engineering - Theoretical Computer Science

Table of contents 

Reachability for finite state systems.- Rewriting systems, reachability analysis in counter/timed/cellular/communicating automata.- Petri-nets.- Computational aspects of semigroups, groups and rings.- Reachability in dynamical and hybrid systems.- Frontiers between decidable and undecidable reachability problems.- Complexity and decidability aspects, predictability in iterative maps and new computational paradigms.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Logics and Meanings of Programs.