LEADER 03811nam  22007575  450 
001 996465865703316
005 20230330000609.0
010   $a3-642-33512-8
024 7 $a10.1007/978-3-642-33512-9
035   $a(CKB)3400000000086235
035   $a(SSID)ssj0000767584
035   $a(PQKBManifestationID)11419312
035   $a(PQKBTitleCode)TC0000767584
035   $a(PQKBWorkID)10740479
035   $a(PQKB)10326583
035   $a(DE-He213)978-3-642-33512-9
035   $a(MiAaPQ)EBC3069883
035   $a(PPN)168324709
035   $a(EXLCZ)993400000000086235
100   $a20120908d2012      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aReachability Problems$b[electronic resource] $e6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings /$fedited by Alain Finkel, Jerome Leroux, Igor Potapov
205   $a1st ed. 2012.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012.
215   $a1 online resource (XII, 149 p. 31 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7550
300   $aInternational conference proceedings.
311   $a3-642-33511-X 
320   $aIncludes bibliographical references and author index.
327   $aReachability problems in algebraic structures, computational models, hybrid systems, logic and verification -- Finite- and infinite-state concurrent systems -- Computational models -- Decision procedures.
330   $aThis book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7550
606   $aComputer science
606   $aSoftware engineering
606   $aMachine theory
606   $aCompilers (Computer programs)
606   $aAlgorithms
606   $aComputer Science Logic and Foundations of Programming
606   $aSoftware Engineering
606   $aFormal Languages and Automata Theory
606   $aCompilers and Interpreters
606   $aAlgorithms
606   $aTheory of Computation
615  0$aComputer science.
615  0$aSoftware engineering.
615  0$aMachine theory.
615  0$aCompilers (Computer programs).
615  0$aAlgorithms.
615 14$aComputer Science Logic and Foundations of Programming.
615 24$aSoftware Engineering.
615 24$aFormal Languages and Automata Theory.
615 24$aCompilers and Interpreters.
615 24$aAlgorithms.
615 24$aTheory of Computation.
676   $a005.1015113
702   $aFinkel$b Alain$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aLeroux$b Jerome$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPotapov$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465865703316
996   $aReachability Problems$92929641
997   $aUNISA