Reachability Problems [electronic resource] : 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / edited by Matthew Hague, Igor Potapov.
Material type:
TextSeries: Theoretical Computer Science and General Issues ; 10506 | Lecture Notes in Computer Science ; 10506Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Edition: 1st ed. 2017Description: XV, 193 p. 34 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319670898Subject(s): Computers | Computer logic | Mathematical logic | Algorithms | Software engineering | Artificial intelligence | Computation by Abstract Devices | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Algorithm Analysis and Problem Complexity | Software Engineering/Programming and Operating Systems | Artificial IntelligenceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK15283 |
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.
There are no comments on this title.