Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010 : proceedings

Resource Information

The work Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010 : proceedings represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books, http://bibfra.me/vocab/marc/conference-publication.

Label

Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010 : proceedings

Title remainder

4th international workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010 : proceedings

Statement of responsibility

Antonin Kucera, Igor Potapov (eds.)

Creator

• RP (Workshop), 2010

Contributor

• Kučera, Antonín, 1971-
• Potapov, Igor

Subject

• Computer systems -- Verification
• Computer systems -- Verification
• Computer systems -- Verification -- Congresses
• Conference papers and proceedings
• Conference papers and proceedings
• Congress
• Decidability (Mathematical logic)
• Decidability (Mathematical logic)
• Decidability (Mathematical logic) -- Congresses
• Graph theory -- Data processing
• Graph theory -- Data processing
• Graph theory -- Data processing -- Congresses
• Informatique
• Logic
• Models, Theoretical
• Computer Systems -- standards

Genre

• Conference papers and proceedings
• Congress
• Congresses

Language

eng

Summary

Annotation

Member of

• LNCS sublibrary, SL 1, Theoretical computer science and general issues
• Lecture notes in computer science, 6227

Cataloging source

GW5XE

Dewey number

003

Illustrations

illustrations

Index

index present

LC call number

QA76.76.V47

LC item number

R6 2010

Literary form

non fiction

Nature of contents

• dictionaries
• bibliography

NLM call number

QA 76.76.V47

Series statement

• Lecture notes in computer science,
• LNCS sublibrary. SL 1, Theoretical computer science and general issues

Series volume

6227

Summary expansion

This book constitutes the research papers presented at the 4th International Workshop, RP 2010 held in Brno, Czech Republic, August 28-29, 2010 and was co-located with Joint MFCS and CSL 2010 (35th International Symposiums on Mathematical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). The revised 9 full papers and the 4 invited talks of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures (semigroups, groups and rings), frontiers between decidable and undecidable reachability problems, predictability in iterative maps and new computational paradigms