Atjaunināt sīkdatņu piekrišanu

Reachability Problems: 13th International Conference, RP 2019, Brussels, Belgium, September 1113, 2019, Proceedings 2019 ed. [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 233 pages, height x width: 235x155 mm, weight: 454 g, 14 Illustrations, color; 261 Illustrations, black and white; XX, 233 p. 275 illus., 14 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 11674
  • Izdošanas datums: 06-Sep-2019
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030308057
  • ISBN-13: 9783030308056
  • 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, 233 pages, height x width: 235x155 mm, weight: 454 g, 14 Illustrations, color; 261 Illustrations, black and white; XX, 233 p. 275 illus., 14 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 11674
  • Izdošanas datums: 06-Sep-2019
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030308057
  • ISBN-13: 9783030308056
This book constitutes the refereed proceedings of the 13th International Conference on Reachability Problems, RP 2019, held in Brussels, Belgium, in September 2019.

The 14 full papers presented were carefully reviewed and selected from 26 submissions. The papers cover topics such as reachability for infinite 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.

Bidding Games on Markov Decision Processes.- Primitivity and synchronizing automata: a functional analytic approach.- Reaching Out Towards Fully Veri?ed Autonomous Systems.- On the m-eternal Domination Number of Cactus Graphs.- On Relevant Equilibria in Reachability Games.- Partial Solvers for Generalized Parity Games.- Reachability in Augmented Interval Markov Chains.- On Solving Word Equations Using SAT.- Parameterised Veri?cation of Publish/Subscribe Networks with Exception Handling.- Cellular automata for the self-stabilisation of colourings and tilings.- On the termination problem for counter machines with incrementing errors.- Reachability Problems on Partially Lossy Queue Automata.- On the computation of the minimal coverability set of Petri nets.- Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds.- Coverability is undecidable in one-dimensional pushdown vector addition systems with resets.- Synthesis of structurally restricted b-bounded Petri nets: complexity results.- Reachability of Five Gossip Protocols.