| Description |
1 online resource (xii, 221 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science, 0302-9743 ; 8169 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 8169, 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Robustness in Timed Automata / Patricia Bouyer, Nicolas Markey, Ocan Sankur -- Automated Verification of Concurrent Software / Daniel Kroening -- Provenance Verification / Rupak Majumdar, Roland Meyer, Zilong Wang -- Reachability Modulo Theories / Akash Lal, Shaz Qadeer -- The Dynamic Complexity of the Reachability Problem on Graphs / Thomas Schwentick -- Reachability Problems for Hierarchical Piecewise Constant Derivative Systems / Paul C. Bell, Shang Chen -- Parametric Interrupt Timed Automata / Beatrice Bérard, Serge Haddad, Aleksandra Jovanović, Didier Lime -- Deciding Continuous-Time Metric Temporal Logic with Counting Modalities / Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro -- MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters / Carlo Bellettini, Matteo Camilli, Lorenzo Capra, Mattia Monga -- Modular Synthesis with Open Components / Ilaria De Crescenzo, Salvatore La Torre -- Parameterized Verification of Broadcast Networks of Register Automata / Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso -- Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games / Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen -- Stability Controllers for Sampled Switched Systems / Laurent Fribourg, Romain Soulat -- Formal Languages, Word Problems of Groups and Decidability / Sam A.M. Jones, Richard M. Thomas -- Verification of Reachability Properties for Time Petri Nets / Kais Klai, Naim Aber, Laure Petrucci -- Branching-Time Model Checking Gap-Order Constraint Systems / Richard Mayr, Patrick Totzke -- Constructing Minimal Coverability Sets / Artturi Piipponen, Antti Valmari -- On the Complexity of Counter Reachability Games / Julien Reichert -- Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities / Ernst W. Mayr, Jeremias Weihmann |
| Summary |
This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite state systems; rewriting systems, reachability analysis in counter/timed/cellular/communicating automata; Petri-nets; computational aspects of semigroups, groups and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects, predictability in iterative maps and new computational paradigms |
| Notes |
International conference proceedings |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
English |
|
Online resource; title from PDF title page (SpringerLink, viewed September 9, 2013) |
| In |
Springer eBooks |
| Subject |
Computer systems -- Verification -- Congresses
|
|
Decidability (Mathematical logic) -- Congresses
|
|
Computer science -- Mathematics -- Congresses
|
|
Electronic Data Processing
|
|
Software
|
|
software.
|
|
Computer science -- Mathematics
|
|
Computer systems -- Verification
|
|
Decidability (Mathematical logic)
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Abdulla, Parosh Aziz, editor
|
|
Potapov, Igor, editor
|
| ISBN |
9783642410369 |
|
3642410367 |
|
3642410359 |
|
9783642410352 |
|
