Reachability Problems
Description
The 8 full papers presented were carefully reviewed and selected from 25 submissions. In addition, 2 invited papers were included in this volume. 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
Persons
Content
Invited Papers .- On decision problems for substitutions in symbolic dynamics.- Games with Full, Longitudinal, and Transverse Observability.- Regular Papers .- Reachability set generation using hybrid relation compatible saturation.- Case Study: Reachability Analysis of a unified Combat-Command-and-Control Model.- Qualitative Multi-Objective Reachability for Ordered Branching MDPs.- Quantum-over-classical Advantage in Solving Multiplayer Games.- Efficient Restrictions of Immediate Observation Petri Nets.- Binary expression of ancestors in the Collatz graph.- The Collatz process embeds a base conversion algorithm.- The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets.