[1408.5965v1] Hourglass Automata
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Formal Languages and Automata Theory

arXiv:1408.5965v1 (cs)
[Submitted on 26 Aug 2014]

Title:Hourglass Automata

Authors:Yuki Osada (The University of Western Australia), Tim French (The University of Western Australia), Mark Reynolds (The University of Western Australia), Harry Smallbone (The University of Western Australia)
View PDF
Abstract:In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate. We then introduce a new clock update for timed automata that allows hourglass automata to be expressed. This allows us to show that language emptiness remains decidable with this update when the number of clocks is two or less. This is done by showing that we can construct a finite untimed graph using clock regions from any timed automaton that use this new update.
Comments: In Proceedings GandALF 2014, arXiv:1408.5560
Subjects: Formal Languages and Automata Theory (cs.FL)
Cite as: arXiv:1408.5965 [cs.FL]
  (or arXiv:1408.5965v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.1408.5965
Journal reference: EPTCS 161, 2014, pp. 175-188
Related DOI: https://doi.org/10.4204/EPTCS.161.16

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 26 Aug 2014 01:16:15 UTC (93 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2014-08
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)