Reachability problems : 15th international conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings / Paul C. Bell, Patrick Totzke, Igor Potapov (eds.).
International Conference on Reachability Problems (15th : 2021 : Liverpool, England); Bell, Paul C., editor.; Totzke, Patrick, editor.; Potapov, Igor, editor.
2021
QA76.76.V47 I58 2021
Available Online

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
Reachability problems : 15th international conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings / Paul C. Bell, Patrick Totzke, Igor Potapov (eds.).
Meeting Name
International Conference on Reachability Problems (15th : 2021 : Liverpool, England)
ISBN
9783030897161 (electronic bk.)
3030897168 (electronic bk.)
9783030897154
303089715X
DOI
https://doi.org/10.1007/978-3-030-89716-1
Published
Cham : Springer, [2021]
Copyright
©2021
Language
English
Description
1 online resource : illustrations (some color)
Item Number
10.1007/978-3-030-89716-1 doi
Call Number
QA76.76.V47 I58 2021
Dewey Decimal Classification
005.1/4
Summary
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.
Note
International conference proceedings.
Includes author index.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file
PDF
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed November 4, 2021).
Added Author
Bell, Paul C., editor.
Totzke, Patrick, editor.
Potapov, Igor, editor.
Series
Lecture notes in computer science ; 13035.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Available in Other Form
Reachability problems.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
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.-

Browse Subjects

Show more subjects...

Statistics

from
to
Export