AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically

Go Generating

AI Traceability

AI parses the academic lineage of this thesis

Generate MRT

On the relationship between reachability problems in timed and counter automata

RP, pp.54-65, (2012)

Cited: 13|Views22

Get fulltext within 24h

View via Publisher

Other Links

dl.acm.org dblp.uni-trier.de academic.microsoft.com

Bibtex

Keywords

logarithmic-space equivalencespace-bounded one-counter automatonprecise computational complexityspace-bounded counter automatonlast reductionMore(3+)

Abstract

This paper establishes a relationship between reachability problems in timed automata and space-bounded counter automata. We show that reachability in timed automata with three or more clocks is naturally logarithmic-space interreducible with reachability in space-bounded counter automata with two counters. We moreover show the logarithmi...More

Code:

Data:

Full Text (Upload PDF)

PPT (Upload PPT)

Similar

Reference

Cited

Author

Christoph Haase

[0]

Joël Ouaknine

[0]

James Worrell

[0]

Your rating :

No Ratings