03811nam 22007575 450 99646586570331620230330000609.03-642-33512-810.1007/978-3-642-33512-9(CKB)3400000000086235(SSID)ssj0000767584(PQKBManifestationID)11419312(PQKBTitleCode)TC0000767584(PQKBWorkID)10740479(PQKB)10326583(DE-He213)978-3-642-33512-9(MiAaPQ)EBC3069883(PPN)168324709(EXLCZ)99340000000008623520120908d2012 u| 0engurnn|008mamaatxtccrReachability Problems[electronic resource] 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings /edited by Alain Finkel, Jerome Leroux, Igor Potapov1st ed. 2012.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2012.1 online resource (XII, 149 p. 31 illus.) Theoretical Computer Science and General Issues,2512-2029 ;7550International conference proceedings.3-642-33511-X Includes bibliographical references and author index.Reachability problems in algebraic structures, computational models, hybrid systems, logic and verification -- Finite- and infinite-state concurrent systems -- Computational models -- Decision procedures.This 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.Theoretical Computer Science and General Issues,2512-2029 ;7550Computer scienceSoftware engineeringMachine theoryCompilers (Computer programs)AlgorithmsComputer Science Logic and Foundations of ProgrammingSoftware EngineeringFormal Languages and Automata TheoryCompilers and InterpretersAlgorithmsTheory of ComputationComputer science.Software engineering.Machine theory.Compilers (Computer programs).Algorithms.Computer Science Logic and Foundations of Programming.Software Engineering.Formal Languages and Automata Theory.Compilers and Interpreters.Algorithms.Theory of Computation.005.1015113Finkel Alainedthttp://id.loc.gov/vocabulary/relators/edtLeroux Jeromeedthttp://id.loc.gov/vocabulary/relators/edtPotapov Igoredthttp://id.loc.gov/vocabulary/relators/edtBOOK996465865703316Reachability Problems2929641UNISA