LEADER 03451nam  22006975  450 
001 996465912803316
005 20230329173210.0
010   $a3-319-67089-1
024 7 $a10.1007/978-3-319-67089-8
035   $a(CKB)3710000001631291
035   $a(DE-He213)978-3-319-67089-8
035   $a(MiAaPQ)EBC5591087
035   $a(PPN)203850505
035   $a(EXLCZ)993710000001631291
100   $a20170824d2017      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aReachability Problems$b[electronic resource] $e11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings /$fedited by Matthew Hague, Igor Potapov
205   $a1st ed. 2017.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017.
215   $a1 online resource (XV, 193 p. 34 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10506
300   $aIncludes index.
311   $a3-319-67088-3 
330   $aThis book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining  mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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 ;$v10506
606   $aComputer science
606   $aMachine theory
606   $aAlgorithms
606   $aSoftware engineering
606   $aArtificial intelligence
606   $aTheory of Computation
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
606   $aAlgorithms
606   $aSoftware Engineering
606   $aArtificial Intelligence
615  0$aComputer science.
615  0$aMachine theory.
615  0$aAlgorithms.
615  0$aSoftware engineering.
615  0$aArtificial intelligence.
615 14$aTheory of Computation.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
615 24$aAlgorithms.
615 24$aSoftware Engineering.
615 24$aArtificial Intelligence.
676   $a003.3
702   $aHague$b Matthew$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPotapov$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465912803316
996   $aReachability Problems$92929641
997   $aUNISA