LEADER 04072nam  22007575  450 
001 996418295003316
005 20230329204858.0
010   $a3-030-61739-4
024 7 $a10.1007/978-3-030-61739-4
035   $a(CKB)4100000011508851
035   $a(DE-He213)978-3-030-61739-4
035   $a(MiAaPQ)EBC6380856
035   $a(PPN)254915744
035   $a(EXLCZ)994100000011508851
100   $a20201012d2020      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aReachability Problems$b[electronic resource] $e14th International Conference, RP 2020, Paris, France, October 19?21, 2020, Proceedings /$fedited by Sylvain Schmitz, Igor Potapov
205   $a1st ed. 2020.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020.
215   $a1 online resource (XXI, 165 p. 126 illus., 13 illus. in color.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12448
311   $a3-030-61738-6 
320   $aIncludes bibliographical references and index.
327   $aInvited 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.
330   $aThis 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12448
606   $aComputer science
606   $aComputer science?Mathematics
606   $aArtificial intelligence
606   $aComputer engineering
606   $aComputer networks
606   $aData structures (Computer science)
606   $aInformation theory
606   $aTheory of Computation
606   $aMathematics of Computing
606   $aArtificial Intelligence
606   $aComputer Engineering and Networks
606   $aData Structures and Information Theory
606   $aComputer Engineering and Networks
615  0$aComputer science.
615  0$aComputer science?Mathematics.
615  0$aArtificial intelligence.
615  0$aComputer engineering.
615  0$aComputer networks.
615  0$aData structures (Computer science).
615  0$aInformation theory.
615 14$aTheory of Computation.
615 24$aMathematics of Computing.
615 24$aArtificial Intelligence.
615 24$aComputer Engineering and Networks.
615 24$aData Structures and Information Theory.
615 24$aComputer Engineering and Networks.
676   $a003.3
702   $aSchmitz$b Sylvain
702   $aPotapov$b Igor
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bUtOrBLW
906   $aBOOK
912   $a996418295003316
996   $aReachability Problems$92929641
997   $aUNISA