Cargando…

Reachability Problems 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings /

This book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The 11 full papers presented together with2 invited papers and 3 abstracts of invited talks were carefully reviewed and selected from 18 s...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Larsen, Kim Guldstrand (Editor ), Potapov, Igor (Editor ), Srba, Jiří (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edición:1st ed. 2016.
Colección:Theoretical Computer Science and General Issues, 9899
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-45994-3
003 DE-He213
005 20230330005236.0
007 cr nn 008mamaa
008 160912s2016 sz | s |||| 0|eng d
020 |a 9783319459943  |9 978-3-319-45994-3 
024 7 |a 10.1007/978-3-319-45994-3  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM037000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Reachability Problems  |h [electronic resource] :  |b 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings /  |c edited by Kim Guldstrand Larsen, Igor Potapov, Jiří Srba. 
250 |a 1st ed. 2016. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2016. 
300 |a XIV, 193 p. 38 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9899 
505 0 |a The Ideal Theory for WSTS -- Rare events for Statistical Model Checking -- On the Complexity of Resource-Bounded Logics -- Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs -- Reachability Predicates for Graph Assertions -- Occam's Razor Applied to the Petri Net Coverability Problem -- Safety Property-driven Stubborn Sets -- Characterizing Word Problems of Groups -- Distributed Synthesis of State-Dependent Switching Control -- Compositional Analysis of Boolean Networks Using Local Fixed-point Iterations -- Decidable Models of Integer-manipulating Programs with Recursive Parallelism -- Robot Games with States in Dimension One -- Insertion-deletion Systems over Relational Words. 
520 |a This book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The 11 full papers presented together with2 invited papers and 3 abstracts of invited talks were carefully reviewed and selected from 18 submissions. The papers cover a range of topics in the field of reachability for infinite 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. 
650 0 |a Computer science. 
650 0 |a Machine theory. 
650 0 |a Algorithms. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Formal Languages and Automata Theory. 
650 2 4 |a Algorithms. 
700 1 |a Larsen, Kim Guldstrand.  |e editor.  |0 (orcid)0000-0002-5953-3384  |1 https://orcid.org/0000-0002-5953-3384  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Potapov, Igor.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Srba, Jiří.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319459936 
776 0 8 |i Printed edition:  |z 9783319459950 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9899 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-45994-3  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)