Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

10

(FIVE YEARS 10)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer International Publishing

9783030617387, 9783030617394

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_10 ◽

2020 ◽

pp. 148-163

Author(s):

Ronny Tredup

Keyword(s):

Flip Flop ◽

Splitting Problem

Download Full-text

Binary Expression of Ancestors in the Collatz Graph

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_8 ◽

2020 ◽

pp. 115-130

Author(s):

Tristan Stérin

Download Full-text

Quantum-over-Classical Advantage in Solving Multiplayer Games

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_6 ◽

2020 ◽

pp. 83-98

Author(s):

Dmitry Kravchenko ◽

Kamil Khadiev ◽

Danil Serov ◽

Ruslan Kapralov

Keyword(s):

Multiplayer Games

Download Full-text

Efficient Restrictions of Immediate Observation Petri Nets

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_7 ◽

2020 ◽

pp. 99-114

Author(s):

Michael Raskin ◽

Chana Weil-Kennedy

Keyword(s):

Download Full-text

Qualitative Multi-objective Reachability for Ordered Branching MDPs

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_5 ◽

2020 ◽

pp. 67-82

Author(s):

Kousha Etessami ◽

Emanuel Martinov

Keyword(s):

Multi Objective

Download Full-text

Reachability Set Generation Using Hybrid Relation Compatible Saturation

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_3 ◽

2020 ◽

pp. 37-51

Author(s):

Shruti Biswal ◽

Andrew S. Miner

Keyword(s):

Reachability Set

Download Full-text

Games with Full, Longitudinal, and Transverse Observability

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_2 ◽

2020 ◽

pp. 20-34

Author(s):

Orna Kupferman

Download Full-text

Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_4 ◽

2020 ◽

pp. 52-66

Author(s):

Sergiy Bogomolov ◽

Marcelo Forets ◽

Kostiantyn Potomkin

Keyword(s):

Command And Control ◽

Control Model ◽

Download Full-text

On Decision Problems for Substitutions in Symbolic Dynamics

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_1 ◽

2020 ◽

pp. 3-19

Author(s):

Valérie Berthé

Keyword(s):

Symbolic Dynamics ◽

Decision Problems

Download Full-text

The Collatz Process Embeds a Base Conversion Algorithm

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-030-61739-4_9 ◽

2020 ◽

pp. 131-147

Author(s):

Tristan Stérin ◽

Damien Woods

Keyword(s):

Conversion Algorithm

Download Full-text