Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Automata theoryAutomated planning and schedulingDREAM (software)Event segment

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Verification of Computation Orchestration Via Timed Automata
Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed web… 
Highly Cited
2006
Highly Cited
2006
Verification of Web Services with Timed Automata
Highly Cited
2004
Highly Cited
2004
Verification of PLC Programs Given as Sequential Function Charts
Programmable Logic Controllers (PLC) are widespread in the manufacturing and processing industries to realize sequential… 
Highly Cited
2003
Highly Cited
2003
Modeling and formal verification of embedded systems based on a Petri net representation
Highly Cited
2002
Highly Cited
2002
Verification of Timed Automata via Satisfiability Checking
In this paper we show how to translate bounded-length verification problems for timed automata into formulae in difference logic… 
1999
1999
Fault coverage in testing real-time systems
Real-time systems interact with their environment, through time constrained input/output events. The misbehavior of real-time… 
Highly Cited
1998
Highly Cited
1998
New Generation of UPPAAL
Uppaal is a tool-set for the design and analysis of real-time systems. In 6] a relatively complete description of Uppaal before… 
Highly Cited
1997
Highly Cited
1997
Modeling of PLC behavior by means of timed net condition/event systems
Net condition/event systems (NCES) are a particular representation of the modeling paradigm of condition/event systems introduced… 
Highly Cited
1997
Highly Cited
1997
Formal verification of a TDMA protocol start-up mechanism
  • Henrik Lönn
  • Proceedings Pacific Rim International Symposium…
  • 1997
  • Corpus ID: 14866066
This paper presents a formal verification of the start-up algorithm of the DACAPO protocol. The protocol uses TDMA (Time Division… 
Highly Cited
1996
Highly Cited
1996
Compositional Specification of Timed Systems (Extended Abstract)
We present timed automata and timed Petri nets and argue that timed automata and their associated parallel composition operator… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)