Normal view MARC view ISBD view

Reachability Problems [electronic resource] : 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings / edited by Paul C. Bell, Patrick Totzke, Igor Potapov.

Contributor(s): Bell, Paul C [editor.] | Totzke, Patrick [editor.] | Potapov, Igor [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 13035Publisher: Cham : Springer International Publishing : Imprint: Springer, 2021Edition: 1st ed. 2021.Description: XVIII, 165 p. 16 illus., 6 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783030897161.Subject(s): Computer science | Artificial intelligence | Software engineering | Computer engineering | Computer networks  | Theory of Computation | Artificial Intelligence | Software Engineering | Computer Engineering and NetworksAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
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.-.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.-.

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.

There are no comments for this item.

Log in to your account to post a comment.