000 03869nam a22006375i 4500
001 978-3-030-61739-4
003 DE-He213
005 20240423125330.0
007 cr nn 008mamaa
008 201012s2020 sz | s |||| 0|eng d
020 _a9783030617394
_9978-3-030-61739-4
024 7 _a10.1007/978-3-030-61739-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aReachability Problems
_h[electronic resource] :
_b14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings /
_cedited by Sylvain Schmitz, Igor Potapov.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXXI, 165 p. 126 illus., 13 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12448
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence.
650 0 _aComputer engineering.
650 0 _aComputer networks .
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 1 4 _aTheory of Computation.
650 2 4 _aMathematics of Computing.
650 2 4 _aArtificial Intelligence.
650 2 4 _aComputer Engineering and Networks.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aComputer Engineering and Networks.
700 1 _aSchmitz, Sylvain.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPotapov, Igor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030617387
776 0 8 _iPrinted edition:
_z9783030617400
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12448
856 4 0 _uhttps://doi.org/10.1007/978-3-030-61739-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c176789
_d176789