Skip to main content
  • Conference proceedings
  • © 2021

Reachability Problems

15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 13035)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): RP: International Conference on Reachability Problems

Conference proceedings info: RP 2021.

Buying options

eBook USD 69.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-89716-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 89.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (10 papers)

  1. Front Matter

    Pages i-xviii
  2. Invited Papers

    1. Front Matter

      Pages 1-1
    2. Quantitative vs. Weighted Automata

      • Udi Boker
      Pages 3-18
  3. Regular Papers

    1. Front Matter

      Pages 67-67
    2. Improvements in Unfolding of Colored Petri Nets

      • Alexander Bilgram, Peter G. Jensen, Thomas Pedersen, Jiří Srba, Peter H. Taankvist
      Pages 69-84
    3. Reachability of Weakly Nonlinear Systems Using Carleman Linearization

      • Marcelo Forets, Christian Schilling
      Pages 85-99
    4. Absent Subsequences in Words

      • Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer
      Pages 115-131
    5. Minimal Number of Calls in Propositional Protocols

      • Joseph Livesey, Dominik Wojtczak
      Pages 132-148
    6. Reachability is NP-Complete Even for the Simplest Neural Networks

      • Marco Sälzer, Martin Lange
      Pages 149-164
  4. Back Matter

    Pages 165-165

Other Volumes

  1. Reachability Problems

About this book

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. In addition, 4 invited papers were included in this volume. The RP proceedings 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.

Chapter ‘Recent Advances on Reachability Problems for Valence Systems’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Keywords

  • architecture verification and validation
  • artificial intelligence
  • automata theory
  • computational game theory
  • computational linguistics
  • computational models
  • embedded systems
  • formal languages
  • formal logic
  • graph theory
  • infinite state systems
  • model checking
  • petri nets
  • software architecture
  • software design
  • software engineering
  • software evaluation
  • theoretical computer science
  • verification

Editors and Affiliations

  • Liverpool John Moores University, Liverpool, UK

    Paul C. Bell

  • University of Liverpool, Liverpool, UK

    Patrick Totzke, Igor Potapov

Bibliographic Information

Buying options

eBook USD 69.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-89716-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 89.99
Price excludes VAT (USA)