Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/1287
Full metadata record
DC FieldValueLanguage
dc.contributorRP (Workshop) ; (11th : ; 2017 : ; London, England) ;en_US
dc.contributor.authorHague, Matthew, ; editor ;en_US
dc.contributor.authorPotapov, Igor, ; editor ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:27:15Z-
dc.date.available2020-05-17T08:27:15Z-
dc.date.issued2017en_US
dc.identifier.isbn9783319670898 ; (electronic bk.) ;en_US
dc.identifier.isbn3319670891 ; (electronic bk.) ;en_US
dc.identifier.isbn9783319670881 ; (print) ;en_US
dc.identifier.isbn3319670883 ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1287-
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionAvailable to OhioLINK libraries ;en_US
dc.descriptionOhio Library and Information Network ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319670881 ;en_US
dc.description.abstractThis 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.statementofresponsibilityMatthew Hague, Igor Potapov (eds.)en_US
dc.format.extent1 online resource (xv, 193 pages) : ; illustrations ;en_US
dc.format.extentInternational conference proceedings ;en_US
dc.format.extentIncludes bibliographical references and author index ;en_US
dc.publisherSpringer,en_US
dc.relation.ispartofseriesLecture notes in computer science, ; 0302-9743 ; ; 10506 ;en_US
dc.relation.ispartofseriesLNCS sublibrary. SL 1, Theoretical computer science and general issues ;en_US
dc.relation.ispartofseriesLecture notes in computer science ; ; 10506. ; 0302-9743 ;en_US
dc.relation.ispartofseriesLNCS sublibrary. ; SL 1, ; Theoretical computer science and general issues ;en_US
dc.relation.haspart9783319670898.pdfen_US
dc.subjectComputer systems ; Verification ; Congresses ;en_US
dc.subjectDecidability (Mathematical logic) ; Congresses ;en_US
dc.subjectComputer science ; Mathematics ; Congresses ;en_US
dc.titleReachability problems :en_US
dc.title.alternative11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings /en_US
dc.title.alternativeRP 2017 ;en_US
dc.typeBooken_US
dc.publisher.placeCham, Switzerland :en_US
dc.classification.lcQA76.76.V47 ;en_US
Appears in Collections:مهندسی فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319670898.pdf5.12 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributorRP (Workshop) ; (11th : ; 2017 : ; London, England) ;en_US
dc.contributor.authorHague, Matthew, ; editor ;en_US
dc.contributor.authorPotapov, Igor, ; editor ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:27:15Z-
dc.date.available2020-05-17T08:27:15Z-
dc.date.issued2017en_US
dc.identifier.isbn9783319670898 ; (electronic bk.) ;en_US
dc.identifier.isbn3319670891 ; (electronic bk.) ;en_US
dc.identifier.isbn9783319670881 ; (print) ;en_US
dc.identifier.isbn3319670883 ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1287-
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionAvailable to OhioLINK libraries ;en_US
dc.descriptionOhio Library and Information Network ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319670881 ;en_US
dc.description.abstractThis 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.statementofresponsibilityMatthew Hague, Igor Potapov (eds.)en_US
dc.format.extent1 online resource (xv, 193 pages) : ; illustrations ;en_US
dc.format.extentInternational conference proceedings ;en_US
dc.format.extentIncludes bibliographical references and author index ;en_US
dc.publisherSpringer,en_US
dc.relation.ispartofseriesLecture notes in computer science, ; 0302-9743 ; ; 10506 ;en_US
dc.relation.ispartofseriesLNCS sublibrary. SL 1, Theoretical computer science and general issues ;en_US
dc.relation.ispartofseriesLecture notes in computer science ; ; 10506. ; 0302-9743 ;en_US
dc.relation.ispartofseriesLNCS sublibrary. ; SL 1, ; Theoretical computer science and general issues ;en_US
dc.relation.haspart9783319670898.pdfen_US
dc.subjectComputer systems ; Verification ; Congresses ;en_US
dc.subjectDecidability (Mathematical logic) ; Congresses ;en_US
dc.subjectComputer science ; Mathematics ; Congresses ;en_US
dc.titleReachability problems :en_US
dc.title.alternative11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings /en_US
dc.title.alternativeRP 2017 ;en_US
dc.typeBooken_US
dc.publisher.placeCham, Switzerland :en_US
dc.classification.lcQA76.76.V47 ;en_US
Appears in Collections:مهندسی فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319670898.pdf5.12 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributorRP (Workshop) ; (11th : ; 2017 : ; London, England) ;en_US
dc.contributor.authorHague, Matthew, ; editor ;en_US
dc.contributor.authorPotapov, Igor, ; editor ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:27:15Z-
dc.date.available2020-05-17T08:27:15Z-
dc.date.issued2017en_US
dc.identifier.isbn9783319670898 ; (electronic bk.) ;en_US
dc.identifier.isbn3319670891 ; (electronic bk.) ;en_US
dc.identifier.isbn9783319670881 ; (print) ;en_US
dc.identifier.isbn3319670883 ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1287-
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionAvailable to OhioLINK libraries ;en_US
dc.descriptionOhio Library and Information Network ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319670881 ;en_US
dc.description.abstractThis 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.statementofresponsibilityMatthew Hague, Igor Potapov (eds.)en_US
dc.format.extent1 online resource (xv, 193 pages) : ; illustrations ;en_US
dc.format.extentInternational conference proceedings ;en_US
dc.format.extentIncludes bibliographical references and author index ;en_US
dc.publisherSpringer,en_US
dc.relation.ispartofseriesLecture notes in computer science, ; 0302-9743 ; ; 10506 ;en_US
dc.relation.ispartofseriesLNCS sublibrary. SL 1, Theoretical computer science and general issues ;en_US
dc.relation.ispartofseriesLecture notes in computer science ; ; 10506. ; 0302-9743 ;en_US
dc.relation.ispartofseriesLNCS sublibrary. ; SL 1, ; Theoretical computer science and general issues ;en_US
dc.relation.haspart9783319670898.pdfen_US
dc.subjectComputer systems ; Verification ; Congresses ;en_US
dc.subjectDecidability (Mathematical logic) ; Congresses ;en_US
dc.subjectComputer science ; Mathematics ; Congresses ;en_US
dc.titleReachability problems :en_US
dc.title.alternative11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings /en_US
dc.title.alternativeRP 2017 ;en_US
dc.typeBooken_US
dc.publisher.placeCham, Switzerland :en_US
dc.classification.lcQA76.76.V47 ;en_US
Appears in Collections:مهندسی فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319670898.pdf5.12 MBAdobe PDFThumbnail
Preview File