EXPSPACE

Known as: NEXPSPACE

In complexity theory, 'EXPSPACE' is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) space, where p(n) is a…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be…

2016

Malfunctioning software systems can cause severe loss of money, sensitive data, or even human life. The ambition is therefore to…

2015

Distance automata are automata weighted over the semiring (ℕ∪{∞},min,+)\documentclass[12pt]{minimal} \usepackage{amsmath…

2014

It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE…

2013

We introduce a new way of defining metric temporal logic over the continuous real model of time. The semantics refer to a single…

2010

We have already met different types of exponential algorithms. Some of them use only polynomial space, among them in particular…

2003

Variable elimination is the basic step of Adaptive Consis-tency8]. It transforms the problem into an equivalent one, having one…

2000

Reachability analysis is a wellknown static analysis tool for the verification of critical properties in concurrent programs and…

1996

Nous presentons, dans cette these, des resultats de complexite pour les problemes de verification (l'accessibilite, la couverture…

1995

We study the complexity of various combinatorial and satisfiability problems when instances are specified using one of the…