Reachability Problems 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Filiot, Emmanuel (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Jungers, Raphaël (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Potapov, Igor (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: Theoretical Computer Science and General Issues ; 11674
• Θέματα: Computer logic.; Software engineering.; Artificial intelligence.; Computer system failures.; Computers.; Computer science-Mathematics.; Logics and Meanings of Programs.; Software Engineering.; Artificial Intelligence.; System Performance and Evaluation.; The Computing Profession.; Mathematics of Computing.

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...

Πίνακας περιεχομένων:

• Bidding Games on Markov Decision Processes
• Primitivity and synchronizing automata: a functional analytic approach
• Reaching Out Towards Fully Verified 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 Verification 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.