Reachability in two-clock timed automata is PSPACE-complete
type: Item
instance of: scholarly article
title: Reachability in two-clock timed automata is PSPACE-complete
zbMATH Open document ID: 1345.68155
author: John Fearnley
author: Marcin Jurdziński
published in: Information and Computation
publication date: 2015-06-09T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6443997
zbMATH Keywords: timed automata
zbMATH Keywords: counter automata
zbMATH Keywords: PSPACE-complete
MaRDI profile type: Publication
full work available at URL: j.ic.2014.12.004
OpenAlex ID: W2952380278
cites work: A theory of timed automata
cites work: Minimum and maximum delay problems in real-time systems
cites work: CONCUR 2004 - Concurrency Theory
cites work: On the Relationship between Reachability Problems in Timed and Counter Automata
cites work: Infinite Runs in Weighted Timed Automata with Energy Constraints
cites work: Reachability in Succinct and Parametric One-Counter Automata
cites work: The complexity of membership problems for circuits over sets of integers
DOI: 10.1016/J.IC.2014.12.004
Recommended article: Reachability in Two-Clock Timed Automata Is PSPACE-Complete
Recommended article: Reachability relations of timed pushdown automata
Recommended article: Q4551181
Recommended article: Q5144644
Recommended article: Q5469517
Recommended article: Q5002803
Recommended article: Q2754074
Recommended article: Timed Pushdown Automata Revisited
Recommended article: Timed P Automata
Recommended article: Q3005245
description: scientific article