Central Library

Normal view MARC view ISBD view

Reachability Problems [electronic resource] : 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings / edited by Alain Finkel, Jerome Leroux, Igor Potapov.

Contributor(s): Finkel, Alain [editor.] | Leroux, Jerome [editor.] | Potapov, Igor [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 7550Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Edition: 1st ed. 2012.Description: XII, 149 p. 31 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642335129.Subject(s): Computer 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 ComputationAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
Contents:
Reachability problems in algebraic structures, computational models, hybrid systems, logic and verification -- Finite- and infinite-state concurrent systems -- Computational models -- Decision procedures.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.