Library of American University of Madaba
Your cart is empty.
Finkel, Alain.
Reachability Problems 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings / [electronic resource] : edited by Alain Finkel, Jérôme Leroux, Igor Potapov. - XII, 149 p. 31 illus. online resource. - Lecture Notes in Computer Science, 7550 0302-9743 ; .
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.
9783642335129
Computer science.
Software engineering.
Computer software.
Logic design.
Computer Science.
Logics and Meanings of Programs.
Software Engineering.
Mathematical Logic and Formal Languages.
Programming Languages, Compilers, Interpreters.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
QA76.9.L63 QA76.5913 QA76.63
005.1015113
Reachability Problems 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings / [electronic resource] : edited by Alain Finkel, Jérôme Leroux, Igor Potapov. - XII, 149 p. 31 illus. online resource. - Lecture Notes in Computer Science, 7550 0302-9743 ; .
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.
9783642335129
Computer science.
Software engineering.
Computer software.
Logic design.
Computer Science.
Logics and Meanings of Programs.
Software Engineering.
Mathematical Logic and Formal Languages.
Programming Languages, Compilers, Interpreters.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
QA76.9.L63 QA76.5913 QA76.63
005.1015113