Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030002497, 9783030002503

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_5 ◽

2018 ◽

pp. 59-74

Author(s):

Petr Jančar ◽

Petr Osička ◽

Zdeněk Sawa

Download Full-text

Knapsack in Hyperbolic Groups

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_7 ◽

2018 ◽

pp. 87-102

Author(s):

Markus Lohrey

Keyword(s):

Hyperbolic Groups

Download Full-text

The Satisfiability of Word Equations: Decidable and Undecidable Theories

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_2 ◽

2018 ◽

pp. 15-29 ◽

Cited By ~ 2

Author(s):

Joel D. Day ◽

Vijay Ganesh ◽

Paul He ◽

Florin Manea ◽

Dirk Nowotka

Keyword(s):

Word Equations

Download Full-text

Constrained Dynamic Tree Networks

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_4 ◽

2018 ◽

pp. 45-58

Author(s):

Matthew Hague ◽

Vincent Penelle

Keyword(s):

Tree Networks ◽

Dynamic Tree

Download Full-text

Left-Eigenvectors Are Certificates of the Orbit Problem

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_3 ◽

2018 ◽

pp. 30-44 ◽

Cited By ~ 1

Author(s):

Steven de Oliveira ◽

Virgile Prevosto ◽

Peter Habermehl ◽

Saddek Bensalem

Keyword(s):

Orbit Problem

Download Full-text

Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_9 ◽

2018 ◽

pp. 117-132 ◽

Cited By ~ 1

Author(s):

Iovka Boneva ◽

Joachim Niehren ◽

Momar Sakho

Keyword(s):

Query Answering

Download Full-text

Qualitative Reachability for Open Interval Markov Chains

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_11 ◽

2018 ◽

pp. 146-160 ◽

Cited By ~ 2

Author(s):

Jeremy Sproston

Keyword(s):

Markov Chains ◽

Open Interval

Download Full-text

Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_6 ◽

2018 ◽

pp. 75-86

Author(s):

Alexei Lisitsa

Download Full-text

Büchi VASS Recognise $$\mathbf {\Sigma }^{1}_{1}$$-complete $${\omega }$$-languages

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_10 ◽

2018 ◽

pp. 133-145 ◽

Cited By ~ 1

Author(s):

Michał Skrzypczak

Keyword(s):

Sigma 1

Download Full-text

Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-00250-3_1 ◽

2018 ◽

pp. 1-14

Author(s):

Julien Alexandre dit Sandretto ◽

Jian Wan

Keyword(s):

Reachability Analysis ◽

Nonlinear Odes ◽

Runge Kutta

Download Full-text

Lecture Notes in Computer Science - Reachability ProblemsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets

Knapsack in Hyperbolic Groups

The Satisfiability of Word Equations: Decidable and Undecidable Theories

Constrained Dynamic Tree Networks

Left-Eigenvectors Are Certificates of the Orbit Problem

Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams

Qualitative Reachability for Open Interval Markov Chains

Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification

Büchi VASS Recognise $$\mathbf {\Sigma }^{1}_{1}$$-complete $${\omega }$$-languages

Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta

Lecture Notes in Computer Science - Reachability Problems
Latest Publications