Reachability Problems

13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings

Häftad, Engelska, 2019

Av Emmanuel Filiot, Raphaël Jungers, Igor Potapov, Raphael Jungers, Igor Jungers, Raphaël

729 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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;

Produktinformation

Utgivningsdatum2019-09-06
Mått155 x 235 x 15 mm
Vikt394 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor233
FörlagSpringer Nature Switzerland AG
ISBN9783030308056

Tillhör följande kategorier

Informationsteknik: allmänt inom Data och it
Systemvetenskap och AI inom Data och it
Programvaruutveckling inom Data och it
Artificiell intelligens inom Data och it

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.- Synthesisof structurally restricted b-bounded Petri nets: complexity results.- Reachability of Five Gossip Protocols.