You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026

Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

Copyright © 2026 by Sage Publications.京ICP备09090397号-11

Search results

Search results page

Articles (169)

Journals (0)

1-10 of 169 results for reachability problem

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Solvability of the Halting and Reachability Problem for Binary 2-tag Systems

Retricted access

Research article

First published 2010-5

Solvability of the Halting and Reachability Problem for Binary 2-tag Systems

Liesbeth De Mol

Fundamenta Informaticae

Select article: Unfolding Based Algorithms for the Reachability Problem

Retricted access

Research article

First published 2001-9

Unfolding Based Algorithms for the Reachability Problem

Javier Esparza, Claus Schröter

Fundamenta Informaticae

Select article: Cellular Automata and Intermediate Reachability Problems

Retricted access

Research article

First published 2002-9

Cellular Automata and Intermediate Reachability Problems

K. Sutner

Fundamenta Informaticae

Select article: Relating Reachability Problems in Timed and Counter Automata

Retricted access

Research article

First published 2016-3-4

Relating Reachability Problems in Timed and Counter Automata

Christoph Haase, Joël Ouaknine, James Worrell

Fundamenta Informaticae

Select article: An Upper Bound for the Reachability Problem of Safe,Elementary Hornets

Retricted access

Research article

First published 2016

An Upper Bound for the Reachability Problem of Safe,Elementary Hornets

Michael Köhler-Bußmeier, Frank Heitmann

Fundamenta Informaticae

Select article: On the Complexity of the Reachability Problem for Safe,Elementary Hornets

Retricted access

Research article

First published 2014-1

On the Complexity of the Reachability Problem for Safe,Elementary Hornets

Michael Köhler-Bußmeier

Fundamenta Informaticae

Select article: Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P

Retricted access

Research article

First published 2013-4

Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P

Jakub Chaloupka

Fundamenta Informaticae

Select article: Flat Parametric Counter Automata

Retricted access

Research article

First published 2009-5

Flat Parametric Counter Automata

Marius Bozga, Radu Iosif, Yassine Lakhnech

Fundamenta Informaticae

Select article: The Reachability Problem for Object Nets

Retricted access

Research article

First published 2007-10

The Reachability Problem for Object Nets

Michael Köhler

Fundamenta Informaticae

Select article: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets

Retricted access

Research article

First published 1999-2

Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets

Keijo Heljanko

Fundamenta Informaticae

1
2
3
•••
17
10 / page

Article type

Publication date

Subjects

Access