Reachability problems : 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings / Sylvain Schmitz, Igor Potapov (eds.).
Material type:
TextSeries: Lecture notes in computer science ; 12448. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham : Springer, 2020Description: 1 online resource (xxi, 165 pages) : illustrations (some color)Content type: - text
- computer
- online resource
- 9783030617394
- 3030617394
- RP 2020
- Computer systems -- Verification -- Congresses
- Decidability (Mathematical logic) -- Congresses
- Computer science -- Mathematics -- Congresses
- Computers
- Computer science -- Mathematics
- Artificial intelligence
- Computer organization
- Data structures (Computer science)
- Computers
- Artificial Intelligence
- Systèmes informatiques -- Vérification -- Congrès
- Décidabilité (Logique mathématique) -- Congrès
- Informatique -- Mathématiques -- Congrès
- Ordinateurs
- Informatique -- Mathématiques
- Intelligence artificielle
- Ordinateurs -- Conception et construction
- Structures de données (Informatique)
- computers
- artificial intelligence
- Decidability (Mathematical logic)
- Computer systems -- Verification
- Artificial intelligence
- Computer organization
- Computer science -- Mathematics
- Computers
- Data structures (Computer science)
- 005.14 23
- 004.0151 23
- QA76.76.V47
- QA76.63
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
eBook
|
e-Library | eBook LNCS | Available |
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.
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.
Includes author index.
Online resource; title from PDF title page (SpringerLink, viewed January 6, 2021).