Sistema Bibliotecario de la Universidad de Quintana Roo

Su carrito está vacío

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

Por: Finkel, Alain [editor.]Colaborador(es): Leroux, JȨrȳme [editor.] | Potapov, Igor [editor.]Tipo de material: TextoTextoSeries Lecture Notes in Computer Science, 7550Editor: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Descripción: XII, 149 p. 31 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642335129Trabajos contenidos: SpringerLink (Online service)Tema(s): 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 DevicesFormatos físicos adicionales: Sin títuloClasificación CDD: 005.1015113 Clasificación LoC:QA76.9.L63QA76.5913QA76.63Recursos en línea: de clik aquí para ver el libro electrónico
Contenidos:
Springer eBooksResumen: 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.
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

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.

ZDB-2-SCS

ZDB-2-LNC

No hay comentarios en este titulo.

para colocar un comentario.