Borrow it
Coverart for item
The Resource Reachability problems : 7th international workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, proceedings, Parosh Aziz Abdulla, Igor Potapov (eds.)

Reachability problems : 7th international workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, proceedings, Parosh Aziz Abdulla, Igor Potapov (eds.)

Creator
Editor
Contributor
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
Language
eng
Work
Publication
Extent
1 online resource (xii, 221 pages)
Note
International conference proceedings
Contents
  • 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
  • Robustness in Timed Automata
  • 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
  • Patricia Bouyer, Nicolas Markey, Ocan Sankur
  • 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
  • Automated Verification of Concurrent Software
  • Daniel Kroening
  • Provenance Verification
  • Rupak Majumdar, Roland Meyer, Zilong Wang
  • Reachability Modulo Theories
  • Akash Lal, Shaz Qadeer
Isbn
9783642410352
Instance
Label
Reachability problems : 7th international workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, proceedings
Title
Reachability problems
Title remainder
7th international workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, proceedings
Statement of responsibility
Parosh Aziz Abdulla, Igor Potapov (eds.)
Title variation
RP 2013
Creator
Contributor
Editor
Subject
Genre
Language
eng
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
Member of
Cataloging source
GW5XE
Dewey number
004
Illustrations
illustrations
Index
index present
LC call number
QA76.76.V47
LC item number
R6 2013
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2013
http://bibfra.me/vocab/lite/meetingName
RP (Workshop)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Abdulla, Parosh Aziz
  • Potapov, Igor
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
8169
http://library.link/vocab/subjectName
  • Computer systems
  • Decidability (Mathematical logic)
  • Computer science
  • Computer science
  • Computer systems
  • Decidability (Mathematical logic)
Label
Reachability problems : 7th international workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, proceedings, Parosh Aziz Abdulla, Igor Potapov (eds.)
Instantiates
Publication
Copyright
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 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
  • Robustness in Timed Automata
  • 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
  • Patricia Bouyer, Nicolas Markey, Ocan Sankur
  • 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
  • Automated Verification of Concurrent Software
  • Daniel Kroening
  • Provenance Verification
  • Rupak Majumdar, Roland Meyer, Zilong Wang
  • Reachability Modulo Theories
  • Akash Lal, Shaz Qadeer
Control code
858527135
Dimensions
unknown
Extent
1 online resource (xii, 221 pages)
File format
unknown
Form of item
online
Isbn
9783642410352
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-41036-9
Other physical details
illustrations (some color).
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)858527135
Label
Reachability problems : 7th international workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, proceedings, Parosh Aziz Abdulla, Igor Potapov (eds.)
Publication
Copyright
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 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
  • Robustness in Timed Automata
  • 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
  • Patricia Bouyer, Nicolas Markey, Ocan Sankur
  • 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
  • Automated Verification of Concurrent Software
  • Daniel Kroening
  • Provenance Verification
  • Rupak Majumdar, Roland Meyer, Zilong Wang
  • Reachability Modulo Theories
  • Akash Lal, Shaz Qadeer
Control code
858527135
Dimensions
unknown
Extent
1 online resource (xii, 221 pages)
File format
unknown
Form of item
online
Isbn
9783642410352
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-41036-9
Other physical details
illustrations (some color).
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)858527135

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...