The Resource Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.)
Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.)
Resource Information
The item Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 Annotation
 Language
 eng
 Extent
 1 online resource (x, 197 pages)
 Contents

 Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata
 Symbolic and Compositional Reachability for Timed Automata
 Temporal Logics over Linear Time Domains Are in PSPACE
 Lossy Counter Machines Decidability Cheat Sheet
 Behavioral Cartography of Timed Automata
 On the Joint Spectral Radius for Bounded Matrix Languages
 ZReachability Problem for Games on 2Dimensional Vector Addition Systems with States Is in P
 Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata
 Rewriting Systems for Reachability in Vector Addition Systems with Pairs
 The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
 Depth Boundedness in Multiset Rewriting Systems with Name Binding
 Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
 Efficient Graph Reachability Query Answering Using Tree Decomposition
 Isbn
 9783642153495
 Label
 Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings
 Title
 Reachability problems
 Title remainder
 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings
 Statement of responsibility
 Antonin Kucera, Igor Potapov (eds.)
 Subject

 Computer systems  Verification
 Computer systems  Verification
 Computer systems  Verification  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Congress
 Decidability (Mathematical logic)
 Decidability (Mathematical logic)
 Decidability (Mathematical logic)  Congresses
 Graph theory  Data processing
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Informatique
 Logic
 Models, Theoretical
 Computer Systems  standards
 Language
 eng
 Summary
 Annotation
 Cataloging source
 GW5XE
 Dewey number
 003
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.76.V47
 LC item number
 R6 2010
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2010
 http://bibfra.me/vocab/lite/meetingName
 RP (Workshop)
 Nature of contents

 dictionaries
 bibliography
 NLM call number
 QA 76.76.V47
 http://library.link/vocab/relatedWorkOrContributorDate
 1971
 http://library.link/vocab/relatedWorkOrContributorName

 Kučera, Antonín
 Potapov, Igor
 Series statement

 Lecture notes in computer science,
 LNCS sublibrary. SL 1, Theoretical computer science and general issues
 Series volume
 6227
 http://library.link/vocab/subjectName

 Computer systems
 Decidability (Mathematical logic)
 Graph theory
 Computer Systems
 Logic
 Models, Theoretical
 Informatique
 Computer systems
 Decidability (Mathematical logic)
 Graph theory
 Summary expansion
 This book constitutes the research papers presented at the 4th International Workshop, RP 2010 held in Brno, Czech Republic, August 2829, 2010 and was colocated with Joint MFCS and CSL 2010 (35th International Symposiums on Mathematical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). The revised 9 full papers and the 4 invited talks of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, PetriNets, computational aspects of algebraic structures (semigroups, groups and rings), frontiers between decidable and undecidable reachability problems, predictability in iterative maps and new computational paradigms
 Label
 Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.)
 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
 Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata  Symbolic and Compositional Reachability for Timed Automata  Temporal Logics over Linear Time Domains Are in PSPACE  Lossy Counter Machines Decidability Cheat Sheet  Behavioral Cartography of Timed Automata  On the Joint Spectral Radius for Bounded Matrix Languages  ZReachability Problem for Games on 2Dimensional Vector Addition Systems with States Is in P  Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata  Rewriting Systems for Reachability in Vector Addition Systems with Pairs  The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions  Depth Boundedness in Multiset Rewriting Systems with Name Binding  Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA  Efficient Graph Reachability Query Answering Using Tree Decomposition
 Control code
 668098360
 Dimensions
 unknown
 Extent
 1 online resource (x, 197 pages)
 Form of item
 online
 Isbn
 9783642153495
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642153495
 Other physical details
 illustrations.
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642153488
 Specific material designation
 remote
 System control number
 (OCoLC)668098360
 Label
 Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.)
 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
 Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata  Symbolic and Compositional Reachability for Timed Automata  Temporal Logics over Linear Time Domains Are in PSPACE  Lossy Counter Machines Decidability Cheat Sheet  Behavioral Cartography of Timed Automata  On the Joint Spectral Radius for Bounded Matrix Languages  ZReachability Problem for Games on 2Dimensional Vector Addition Systems with States Is in P  Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata  Rewriting Systems for Reachability in Vector Addition Systems with Pairs  The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions  Depth Boundedness in Multiset Rewriting Systems with Name Binding  Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA  Efficient Graph Reachability Query Answering Using Tree Decomposition
 Control code
 668098360
 Dimensions
 unknown
 Extent
 1 online resource (x, 197 pages)
 Form of item
 online
 Isbn
 9783642153495
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642153495
 Other physical details
 illustrations.
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642153488
 Specific material designation
 remote
 System control number
 (OCoLC)668098360
Subject
 Computer systems  Verification
 Computer systems  Verification
 Computer systems  Verification  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Congress
 Decidability (Mathematical logic)
 Decidability (Mathematical logic)
 Decidability (Mathematical logic)  Congresses
 Graph theory  Data processing
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Informatique
 Logic
 Models, Theoretical
 Computer Systems  standards
Genre
Member of
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
 Lecture notes in computer science, 6227
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Reachabilityproblems4thinternational/bKGM3eMoFjc/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Reachabilityproblems4thinternational/bKGM3eMoFjc/">Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Reachabilityproblems4thinternational/bKGM3eMoFjc/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Reachabilityproblems4thinternational/bKGM3eMoFjc/">Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 2829, 2010 : proceedings, Antonin Kucera, Igor Potapov (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>