FEEDBACK Smiley face
Normal view MARC view ISBD view

Reachability Problems [electronic resource] :6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings /

Contributor(s): Finkel, Alain [editor.] | Leroux, Jérôme [editor.] | Potapov, Igor [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 7550Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 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 | Programming languages (Electronic computers) | Computers | Algorithms | Computer logic | Mathematical logic | 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 DevicesOnline 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 eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    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.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in