Normal view MARC view ISBD view

Reachability Problems [electronic resource] : 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings / edited by Sylvain Schmitz, Igor Potapov.

Contributor(s): Schmitz, Sylvain [editor.] | Potapov, Igor [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 12448Publisher: Cham : Springer International Publishing : Imprint: Springer, 2020Edition: 1st ed. 2020.Description: XXI, 165 p. 126 illus., 13 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783030617394.Subject(s): Computer 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 NetworksAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.