Reachability Problems 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings
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
Other Authors: | , , |
---|---|
Format: | eBook |
Language: | English |
Published: |
Cham
Springer International Publishing
2021, 2021
|
Edition: | 1st ed. 2021 |
Series: | Theoretical Computer Science and General Issues
|
Subjects: | |
Online Access: | |
Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- Invited Papers
- Quantitative vs. Weighted Automata
- Theorem Proving Using Clausal Resolution: From Past to Present
- Population Protocols: Beyond Runtime Analysis
- Recent Advances on Reachability Problems for Valence Systems (Invited Talk)
- Regular Papers
- Improvements in Unfolding of Colored Petri Nets
- Reachability of weakly nonlinear systems using Carleman linearization
- Continued Fraction approach to Gauss-Reduction theory
- Absent Subsequences in Words
- Minimal Number of Calls in Propositional Protocols
- Reachability Is NP-Complete Even for the Simplest Neural Networks.-