Reachability Problems
Description
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.
More details
Other editions
Additional editions
Content
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.