| Description |
1 online resource |
| Series |
Lecture notes in computer science, 0302-9743 ; 7550 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7550.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Fraenkel-Mostowski Sets with Non-homogeneous Atoms / Mikołaj Bojańczyk and Sławomir Lasota -- Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata / Sylvain Salvati and Igor Walukiewicz -- Decision Problems for Linear Recurrence Sequences / Joël Ouaknine and James Worrell -- Playing Games with Counter Automata / Antonín Kučera -- LTL-Model-Checking via Model Composition / Ingo Felscher -- On the Relationship between Reachability Problems in Timed and Counter Automata / Christoph Haase, Joël Ouaknine and James Worrell -- Smooth Sand Piles / Stefano Brocchi and Paolo Massazza -- Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis / Luca Benvenuti, Davide Bresolin, Pieter Collins, Alberto Ferrari and Luca Geretti, et al. -- Robustness of Time Petri Nets under Guard Enlargement / S. Akshay, Loïc Hélouët, Claude Jard and Pierre-Alain Reynier -- Efficient Probabilistic Model Checking of Systems with Ranged Probabilities / Khalil Ghorbal, Parasara Sridhar Duggirala, Vineet Kahlon, Franjo Ivančić and Aarti Gupta -- On the Length of Knot Transformations via Reidemeister Moves I and II / Rafiq Saleh -- Invariants for LTI Systems with Uncertain Input / Paul Hänsch and Stefan Kowalewski |
| Summary |
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 |
| Analysis |
Computer science |
|
Software engineering |
|
Computer software |
|
Logic design |
|
Logics and Meanings of Programs |
|
Mathematical Logic and Formal Languages |
|
Programming Languages, Compilers, Interpreters |
|
Algorithm Analysis and Problem Complexity |
|
Computation by Abstract Devices |
|
computerwetenschappen |
|
computer sciences |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
programmeertalen |
|
programming languages |
|
wiskunde |
|
mathematics |
|
logica |
|
logic |
|
computational science |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and author index |
| Subject |
Computer systems -- Verification -- Congresses
|
|
Decidability (Mathematical logic) -- Congresses
|
|
Computer science -- Mathematics -- Congresses
|
|
Computer algorithms.
|
|
Algorithms.
|
|
Numerical Analysis, Computer-Assisted
|
|
Algorithms
|
|
algorithms.
|
|
Informatique.
|
|
Computer algorithms
|
|
Algorithms
|
|
Computer science -- Mathematics
|
|
Computer systems -- Verification
|
|
Decidability (Mathematical logic)
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Software.
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Finkel, A. (Alain), 1958-
|
|
Leroux, Jérôme
|
|
Potapov, Igor.
|
| ISBN |
9783642335129 |
|
3642335128 |
|
364233511X |
|
9783642335112 |
|
9783642326295 |
|
3642326293 |
|
