Cargando…
Reachability Problems 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings /
This book constitutes the proceedings of the 8th International Workshop on Reachability Problems, RP 2014, held in Oxford, UK, in September 2014. The 17 papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains a paper summarizing the invited ta...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2014.
|
| Edición: | 1st ed. 2014. |
| Colección: | Theoretical Computer Science and General Issues,
8762 |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-11439-2 | ||
| 003 | DE-He213 | ||
| 005 | 20230329220144.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 140915s2014 sz | s |||| 0|eng d | ||
| 020 | |a 9783319114392 |9 978-3-319-11439-2 | ||
| 024 | 7 | |a 10.1007/978-3-319-11439-2 |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 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings / |c edited by Joel Ouaknine, Igor Potapov, James Worrell. |
| 250 | |a 1st ed. 2014. | ||
| 264 | 1 | |a Cham : |b Springer International Publishing : |b Imprint: Springer, |c 2014. | |
| 300 | |a XX, 246 p. 59 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 8762 | |
| 505 | 0 | |a Complexity Bounds for Ordinal-Based Termination -- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems -- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives -- Parameterized Verification of Communicating Automata under Context Bounds -- Regular Strategies in Pushdown Reachability Games -- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations -- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic -- Synthesising Succinct Strategies in Safety and Reachability Games -- Integer Vector Addition Systems with States -- Reachability in MDPs: Refining Convergence of Value Iteration -- On the Expressiveness of Metric Temporal Logic over Bounded Timed Words -- Trace Inclusion for One-Counter Nets Revisited -- Mean-Payoff Games with Partial-Observation -- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions -- On Functions Weakly Computable by Petri Nets and Vector Addition Systems -- Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems -- Transformations for Compositional Verification of Assumption-Commitment Properties -- Compositional Reachability in Petri Nets. | |
| 520 | |a This book constitutes the proceedings of the 8th International Workshop on Reachability Problems, RP 2014, held in Oxford, UK, in September 2014. The 17 papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains a paper summarizing the invited talk. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. | ||
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Software engineering. | |
| 650 | 0 | |a Compilers (Computer programs). | |
| 650 | 0 | |a Machine theory. | |
| 650 | 0 | |a Coding theory. | |
| 650 | 0 | |a Information theory. | |
| 650 | 1 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Computer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | |a Software Engineering. |
| 650 | 2 | 4 | |a Compilers and Interpreters. |
| 650 | 2 | 4 | |a Formal Languages and Automata Theory. |
| 650 | 2 | 4 | |a Coding and Information Theory. |
| 700 | 1 | |a Ouaknine, Joel. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Potapov, Igor. |e editor. |0 (orcid)0000-0002-7192-7853 |1 https://orcid.org/0000-0002-7192-7853 |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Worrell, James. |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 9783319114408 |
| 776 | 0 | 8 | |i Printed edition: |z 9783319114385 |
| 830 | 0 | |a Theoretical Computer Science and General Issues, |x 2512-2029 ; |v 8762 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-319-11439-2 |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) | ||