Timed automaton

In automata theory, a timed automaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a timed automaton… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
This paper describes a major new release of the PRISM probabilistic model checker, adding, in particular, quantitative… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this work we tackle the following problem given a timed automaton restrict its transition relation in a systematic way so that… (More)
Is this relevant?
2003
2003
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2002
2002
Automatic controller synthesis and veriication techniques promise to revolutionize the construction of high-conndence software… (More)
Is this relevant?
2002
2002
We describe a general automata-theoretic approach for analyzing the veri0cation problems of discrete timed automata (i.e., timed… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper we study the problem of fault diagnosis in the context of dense-time automata. Our work is inspired from [SSL95… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this work we tackle the following problem given a timed automaton and a target set F of con gurations restrict its transition… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The main purpose of this paper is to explain how to use Kronos, a tool for formally checking whether a real-time system meets its… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Abs t r ac t . This paper presents algorithms for the automatic synthesis of real-time controllers by finding a winning strategy… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Abstrac t . We propose timed automata to model the behavior of real-time systems over time. Our definition provides a simple, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?