Igor Potapov – författare

This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018.The 11 full papers presented were carefully reviewed and selected from 21 submissions. The papers cover topics such as 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.

This book constitutes the refereed proceedings of the 13th International Conference on Reachability Problems, RP 2019, held in Brussels, Belgium, in September 2019.The 14 full papers presented were carefully reviewed and selected from 26 submissions. The papers cover topics such as reachability for infinite state systems;

This book constitutes the refereed proceedings of the 14th International Conference on Reachability Problems, RP 2020, held in Paris, France in October 2020.The 8 full papers presented were carefully reviewed and selected from 25 submissions. The papers cover topics such as reachability for infinite state systems;

This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2021, held in Liverpool, UK in October 2021. The 6 full papers presented were carefully reviewed and selected from 27 submissions.

This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2022, held in Kaiserslautern, Germany, in October 2022.The 8 full papers presented were carefully reviewed and selected from 14 submissions. The RP proceedings cover topics such as reachability for infinite state systems;

This book constitutes the refereed proceedings of the 17th International Conference on Reachability Problems, RP 2023, held in Nice, France, during October 11–13, 2023.The 13 full papers included in this book were carefully reviewed and selected from 19 submissions. They present recent research on reachability problems to promote the exploration of new approaches for the modeling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.

This book constitutes the proceedings of the 19th International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications, ICTERI 2024, held in Lviv, Ukraine, during September 23–27, 2024.The 29 full papers, 2 short papers and 3 keynote papers included in this volume were carefully reviewed and selected from 83 submissions. They were organized in topical sections as follows: main conference; PhD symposium; and research in progress.

This book CCIS 2647 constitutes the refereed proceedings of First Research Twinning Conference on Digitalisation and Digital Transformation, RTC-Digital 2023, held in Liverpool, UK, during March 27–30, 2023.The 29 full papers were carefully reviewed and selected from 101 submissions.The objective is to help Ukrainian academics at Universities and Research institutes to integrate into the international research network and to find new research contacts. In the long term, the high-quality research across the Digital Theme should drive the development of the Digital Infrastructure, Digital Economy and IT sector in Ukraine and support the recent OECD Policy Response "Digitalisation for recovery in Ukraine".

This book constitutes the proceedings of the 8th International Workshop on Reachability Problems, RP 2014, held in Oxford, UK, in September 2014. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.

This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing.

This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Reachability Problems, RP 2015, held in Warsaw, Poland, in September 2015. The papers cover a range of topics inthe field of reachability for infinite state systems; reachability in dynamical and hybrid systems;

This book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The papers cover a range of topics in the field of reachability for infinite state systems;

This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017.

This book constitutes the research papers presented at the 3rd International Workshop, RP 2009 held in Palaiseau, France, September 23-25, 2009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms.

This volume contains the papers presented at the 4th International Workshop on Reachability Problems, RP 2010 held during August 28-29, 2010 in the F- ulty of Informatics, Masaryk University, Brno, Czech Republic and co-located with Joint MFCS and CSL 2010 (35th InternationalSymposiums on Mathem- ical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). RP 2010 was the fourth in the series of workshops following three successful meetings at Ecole Polytechnique, France in 2009 at University of Liverpool, UK in 2008 and at Turku University, Finland in 2007. TheReachabilityProblemsworkshopsseriesaimsatgatheringtogethersch- ars from diverse disciplines and backgrounds interested in reachability problems that appearin algebraicstructures,computationalmodels, hybridsystems, logic and veri?cation, etc. Reachability is a fundamental problem in the context of many models and abstractions which describe various computational processes. Analysisofthecomputationaltracesandpredictabilityquestionsforsuchmodels can be formalized as a set of di?erent reachability problems.In general, reac- bility can be formulated as follows: Given a computational system with a set of allowed transformations (functions), decide whether a certain state of a system is reachable from a given initial state by a set of allowed transformations. The same questions can be asked not only about reachability of exact states of the system but also about a set of states expressed in terms of some property as a parameterized reachability problem. Another set of predictability questions can be seen in terms of reachability of eligible traces of computations,unavoidability ofsomedynamicsandapossibilitytoavoidundesirabledynamicsusingalimited control.

This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011.The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in algebraic structures, computational models, hybrid systems, logic, and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modelled as games.

This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games.