Syndetics omslagsbild
Bild från Syndetics

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

Medverkande: Materialtyp: TextSerie: Theoretical Computer Science and General Issues ; 7550Utgivningsuppgift: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Utgåva: 1st ed. 2012Beskrivning: XII, 149 p. 31 illus. online resourceInnehållstyp:
  • text
Medietyp:
  • computer
Bärartyp:
  • online resource
ISBN:
  • 9783642335129
Ämnen: Fler format: Printed edition:: Ingen titel; Printed edition:: Ingen titelDDK-klassifikation:
  • 004.0151 23
Library of Congress (LC) klassifikationskod:
  • QA75.5-76.95
Onlineresurser:
Innehåll:
Reachability problems in algebraic structures, computational models, hybrid systems, logic and verification -- Finite- and infinite-state concurrent systems -- Computational models -- Decision procedures.
I: Springer Nature eBookSammanfattning: 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.
Inga fysiska exemplar för denna post

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.

Licensed e-book