Please use this identifier to cite or link to this item:
http://localhost/handle/Hannan/1287
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | RP (Workshop) ; (11th : ; 2017 : ; London, England) ; | en_US |
dc.contributor.author | Hague, Matthew, ; editor ; | en_US |
dc.contributor.author | Potapov, Igor, ; editor ; | en_US |
dc.date.accessioned | 2013 | en_US |
dc.date.accessioned | 2020-05-17T08:27:15Z | - |
dc.date.available | 2020-05-17T08:27:15Z | - |
dc.date.issued | 2017 | en_US |
dc.identifier.isbn | 9783319670898 ; (electronic bk.) ; | en_US |
dc.identifier.isbn | 3319670891 ; (electronic bk.) ; | en_US |
dc.identifier.isbn | 9783319670881 ; (print) ; | en_US |
dc.identifier.isbn | 3319670883 ; | en_US |
dc.identifier.uri | http://localhost/handle/Hannan/1287 | - |
dc.description | en_US | |
dc.description | en_US | |
dc.description | Available to OhioLINK libraries ; | en_US |
dc.description | Ohio Library and Information Network ; | en_US |
dc.description | en_US | |
dc.description | en_US | |
dc.description | Printed edition: ; 9783319670881 ; | en_US |
dc.description.abstract | This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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 ; | en_US |
dc.description.statementofresponsibility | Matthew Hague, Igor Potapov (eds.) | en_US |
dc.format.extent | 1 online resource (xv, 193 pages) : ; illustrations ; | en_US |
dc.format.extent | International conference proceedings ; | en_US |
dc.format.extent | Includes bibliographical references and author index ; | en_US |
dc.publisher | Springer, | en_US |
dc.relation.ispartofseries | Lecture notes in computer science, ; 0302-9743 ; ; 10506 ; | en_US |
dc.relation.ispartofseries | LNCS sublibrary. SL 1, Theoretical computer science and general issues ; | en_US |
dc.relation.ispartofseries | Lecture notes in computer science ; ; 10506. ; 0302-9743 ; | en_US |
dc.relation.ispartofseries | LNCS sublibrary. ; SL 1, ; Theoretical computer science and general issues ; | en_US |
dc.relation.haspart | 9783319670898.pdf | en_US |
dc.subject | Computer systems ; Verification ; Congresses ; | en_US |
dc.subject | Decidability (Mathematical logic) ; Congresses ; | en_US |
dc.subject | Computer science ; Mathematics ; Congresses ; | en_US |
dc.title | Reachability problems : | en_US |
dc.title.alternative | 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / | en_US |
dc.title.alternative | RP 2017 ; | en_US |
dc.type | Book | en_US |
dc.publisher.place | Cham, Switzerland : | en_US |
dc.classification.lc | QA76.76.V47 ; | en_US |
Appears in Collections: | مهندسی فناوری اطلاعات |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
9783319670898.pdf | 5.12 MB | Adobe PDF | Preview File |
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | RP (Workshop) ; (11th : ; 2017 : ; London, England) ; | en_US |
dc.contributor.author | Hague, Matthew, ; editor ; | en_US |
dc.contributor.author | Potapov, Igor, ; editor ; | en_US |
dc.date.accessioned | 2013 | en_US |
dc.date.accessioned | 2020-05-17T08:27:15Z | - |
dc.date.available | 2020-05-17T08:27:15Z | - |
dc.date.issued | 2017 | en_US |
dc.identifier.isbn | 9783319670898 ; (electronic bk.) ; | en_US |
dc.identifier.isbn | 3319670891 ; (electronic bk.) ; | en_US |
dc.identifier.isbn | 9783319670881 ; (print) ; | en_US |
dc.identifier.isbn | 3319670883 ; | en_US |
dc.identifier.uri | http://localhost/handle/Hannan/1287 | - |
dc.description | en_US | |
dc.description | en_US | |
dc.description | Available to OhioLINK libraries ; | en_US |
dc.description | Ohio Library and Information Network ; | en_US |
dc.description | en_US | |
dc.description | en_US | |
dc.description | Printed edition: ; 9783319670881 ; | en_US |
dc.description.abstract | This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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 ; | en_US |
dc.description.statementofresponsibility | Matthew Hague, Igor Potapov (eds.) | en_US |
dc.format.extent | 1 online resource (xv, 193 pages) : ; illustrations ; | en_US |
dc.format.extent | International conference proceedings ; | en_US |
dc.format.extent | Includes bibliographical references and author index ; | en_US |
dc.publisher | Springer, | en_US |
dc.relation.ispartofseries | Lecture notes in computer science, ; 0302-9743 ; ; 10506 ; | en_US |
dc.relation.ispartofseries | LNCS sublibrary. SL 1, Theoretical computer science and general issues ; | en_US |
dc.relation.ispartofseries | Lecture notes in computer science ; ; 10506. ; 0302-9743 ; | en_US |
dc.relation.ispartofseries | LNCS sublibrary. ; SL 1, ; Theoretical computer science and general issues ; | en_US |
dc.relation.haspart | 9783319670898.pdf | en_US |
dc.subject | Computer systems ; Verification ; Congresses ; | en_US |
dc.subject | Decidability (Mathematical logic) ; Congresses ; | en_US |
dc.subject | Computer science ; Mathematics ; Congresses ; | en_US |
dc.title | Reachability problems : | en_US |
dc.title.alternative | 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / | en_US |
dc.title.alternative | RP 2017 ; | en_US |
dc.type | Book | en_US |
dc.publisher.place | Cham, Switzerland : | en_US |
dc.classification.lc | QA76.76.V47 ; | en_US |
Appears in Collections: | مهندسی فناوری اطلاعات |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
9783319670898.pdf | 5.12 MB | Adobe PDF | Preview File |
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | RP (Workshop) ; (11th : ; 2017 : ; London, England) ; | en_US |
dc.contributor.author | Hague, Matthew, ; editor ; | en_US |
dc.contributor.author | Potapov, Igor, ; editor ; | en_US |
dc.date.accessioned | 2013 | en_US |
dc.date.accessioned | 2020-05-17T08:27:15Z | - |
dc.date.available | 2020-05-17T08:27:15Z | - |
dc.date.issued | 2017 | en_US |
dc.identifier.isbn | 9783319670898 ; (electronic bk.) ; | en_US |
dc.identifier.isbn | 3319670891 ; (electronic bk.) ; | en_US |
dc.identifier.isbn | 9783319670881 ; (print) ; | en_US |
dc.identifier.isbn | 3319670883 ; | en_US |
dc.identifier.uri | http://localhost/handle/Hannan/1287 | - |
dc.description | en_US | |
dc.description | en_US | |
dc.description | Available to OhioLINK libraries ; | en_US |
dc.description | Ohio Library and Information Network ; | en_US |
dc.description | en_US | |
dc.description | en_US | |
dc.description | Printed edition: ; 9783319670881 ; | en_US |
dc.description.abstract | This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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 ; | en_US |
dc.description.statementofresponsibility | Matthew Hague, Igor Potapov (eds.) | en_US |
dc.format.extent | 1 online resource (xv, 193 pages) : ; illustrations ; | en_US |
dc.format.extent | International conference proceedings ; | en_US |
dc.format.extent | Includes bibliographical references and author index ; | en_US |
dc.publisher | Springer, | en_US |
dc.relation.ispartofseries | Lecture notes in computer science, ; 0302-9743 ; ; 10506 ; | en_US |
dc.relation.ispartofseries | LNCS sublibrary. SL 1, Theoretical computer science and general issues ; | en_US |
dc.relation.ispartofseries | Lecture notes in computer science ; ; 10506. ; 0302-9743 ; | en_US |
dc.relation.ispartofseries | LNCS sublibrary. ; SL 1, ; Theoretical computer science and general issues ; | en_US |
dc.relation.haspart | 9783319670898.pdf | en_US |
dc.subject | Computer systems ; Verification ; Congresses ; | en_US |
dc.subject | Decidability (Mathematical logic) ; Congresses ; | en_US |
dc.subject | Computer science ; Mathematics ; Congresses ; | en_US |
dc.title | Reachability problems : | en_US |
dc.title.alternative | 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / | en_US |
dc.title.alternative | RP 2017 ; | en_US |
dc.type | Book | en_US |
dc.publisher.place | Cham, Switzerland : | en_US |
dc.classification.lc | QA76.76.V47 ; | en_US |
Appears in Collections: | مهندسی فناوری اطلاعات |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
9783319670898.pdf | 5.12 MB | Adobe PDF | Preview File |