Zum Hauptinhalt springen
Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Reachability Problems -

Reachability Problems

13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings
Buch | Softcover
XX, 233 Seiten
2019
Springer International Publishing (Verlag)
978-3-030-30805-6 (ISBN)
CHF 86,85 inkl. MwSt
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 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.- Synthesisof structurally restricted b-bounded Petri nets: complexity results.- Reachability of Five Gossip Protocols.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo XX, 233 p. 275 illus., 14 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 397 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Schlagworte Applications • Artificial Intelligence • Automata Theory • Computer Science • conference proceedings • Formal Logic • graph theory • Informatics • Petri Nets • Research • Software engineering • Software Evaluation • theorem proving • verification
ISBN-10 3-030-30805-7 / 3030308057
ISBN-13 978-3-030-30805-6 / 9783030308056
Zustand Neuware
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 53,15
Teil 2 der gestreckten Abschlussprüfung Fachinformatiker/-in …

von Dirk Hardy; Annette Schellenberg; Achim Stiefel

Buch | Softcover (2025)
Europa-Lehrmittel (Verlag)
CHF 37,90