Reachability Problems Reachability Problems

Reachability Problems

    • ‏54٫99 US$
    • ‏54٫99 US$

وصف الناشر

This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011.
The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in 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 modelled as games.

النوع
كمبيوتر وإنترنت
تاريخ النشر
٢٠١١
٢٥ سبتمبر
اللغة
EN
الإنجليزية
عدد الصفحات
٢٥٧
الناشر
Springer Berlin Heidelberg
البائع
Springer Nature B.V.
الحجم
١٠
‫م.ب.‬
CONCUR 2011 -- Concurrency Theory CONCUR 2011 -- Concurrency Theory
٢٠١١
Automated Technology for Verification and Analysis Automated Technology for Verification and Analysis
٢٠٠٩
SOFSEM 2009: Theory and Practice of Computer Science SOFSEM 2009: Theory and Practice of Computer Science
٢٠٠٩
Foundations of Software Science and Computational Structures Foundations of Software Science and Computational Structures
٢٠٠٩
Automata, Languages and Programming Automata, Languages and Programming
٢٠١٠
Computer Aided Verification Computer Aided Verification
٢٠١٠