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
2010
Highly Cited
2010
Verification of a Timed Multitask System With Uppaal
System and program verification has been a large area of research since the introduction of computers in industrial systems. It… 
Highly Cited
2008
Highly Cited
2008
Automatic Timed Test Case Generation for Web Services Composition
In order to specify the composition of Web services, WSBPEL was defined as an orchestrating language by an international… 
2008
2008
Concavely-Priced Timed Automata
Concavely-priced timed automata, a generalization of linearly-priced timed automata, are introduced. Computing the minimum value… 
Highly Cited
2006
Highly Cited
2006
Representation, Verification, and Computation of Timed Properties in Web
In this paper we address the problem of qualitative and quantitative analysis of timing aspects of Web service compositions… 
2005
2005
Integrating Object-Z with timed automata
When designing a complex system, Object-Z is a powerful logic-based language for modeling the system state aspects, and timed… 
Highly Cited
2003
Highly Cited
2003
Modeling and formal verification of embedded systems based on a Petri net representation
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
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… 
1996
1996
Fischer's Protocol Revisited: A Simple Proof Using Modal Constraints
As a case study, we apply a constraint-oriented state-based proof methodology to Fischer's protocol. The method exploits… 
1996
1996
An analysis of the timed Z-channel
Our timed Z-channel (a general case of the Z-channel) appears as the basis for a large class of covert channels. Golomb (1980… 
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)