04047nam 22007575 450 991042768040332120230329204858.03-030-61739-410.1007/978-3-030-61739-4(CKB)4100000011508851(DE-He213)978-3-030-61739-4(MiAaPQ)EBC6380856(PPN)254915744(EXLCZ)99410000001150885120201012d2020 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierReachability Problems 14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings /edited by Sylvain Schmitz, Igor Potapov1st ed. 2020.Cham :Springer International Publishing :Imprint: Springer,2020.1 online resource (XXI, 165 p. 126 illus., 13 illus. in color.) Theoretical Computer Science and General Issues,2512-2029 ;124483-030-61738-6 Includes bibliographical references and index.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.This book constitutes the refereed proceedings of the 14th International Conference on Reachability Problems, RP 2020, held in Paris, France in October 2020. 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.Theoretical Computer Science and General Issues,2512-2029 ;12448Computer scienceComputer science—MathematicsArtificial intelligenceComputer engineeringComputer networksData structures (Computer science)Information theoryTheory of ComputationMathematics of ComputingArtificial IntelligenceComputer Engineering and NetworksData Structures and Information TheoryComputer Engineering and NetworksComputer science.Computer science—Mathematics.Artificial intelligence.Computer engineering.Computer networks.Data structures (Computer science).Information theory.Theory of Computation.Mathematics of Computing.Artificial Intelligence.Computer Engineering and Networks.Data Structures and Information Theory.Computer Engineering and Networks.003.3Schmitz SylvainPotapov IgorMiAaPQMiAaPQUtOrBLWBOOK9910427680403321Reachability Problems3573647UNINA