Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	September 2011
Genre:	EDV / Informatik
	Algorithm Analysis and Problem Complexity / Algorithms / Algorithms & data structures / C / Compilers & interpreters / Computation by Abstract Devices / Computer architecture & logic design / Computer logic / computer science / Computers / Logics and Meanings of Programs / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical Logic and Foundations / Mathematical theory of computation / Programming & scripting languages# general / Programming languages (Electronic computers) / Programming Languages, Compilers, Interpreters / Software Engineering / Theory of Computation mehr...
ISBN:	9783642242878
EAN-Code:	9783642242878
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#6945 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	399 gr
Seiten:	245
Illustration:	XII, 245 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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.