Atjaunināt sīkdatņu piekrišanu

Reachability Problems: 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings 1st ed. 2017 [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 193 pages, height x width: 235x155 mm, weight: 3285 g, 34 Illustrations, black and white; XV, 193 p. 34 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 10506
  • Izdošanas datums: 25-Aug-2017
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319670883
  • ISBN-13: 9783319670881
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 193 pages, height x width: 235x155 mm, weight: 3285 g, 34 Illustrations, black and white; XV, 193 p. 34 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 10506
  • Izdošanas datums: 25-Aug-2017
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319670883
  • ISBN-13: 9783319670881
This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions.

The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining
mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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.
Reachability problems in infinite state systems.- rewriting systems.- dynamical and hybrid systems.- reachability problems in logic and verification.- eachability analysis in different computational models.- Petri-Nets.- Computational aspects of algebraic structures.