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.
2012
2012
A time stamp reduction method for state space exploration using colored Petri nets
In this paper we present a state space exploration method implemented as part of a Decision Support Tool designed to improve the… 
2008
2008
Concavely-Priced Timed Automata
Concavely-priced timed automata, a generalization of linearly-priced timed automata, are introduced. Computing the minimum value… 
2007
2007
Compact Timed Automata for PLC Programs
H.X. Willems University of Nijmegen Computing Science Institute P.O.Box 9010 6500 GL Nijmegen, The Netherlands November 24, 1999… 
2007
2007
Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times
In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real-time tasks… 
Highly Cited
2004
Highly Cited
2004
A Generic Approach to Schedulability Analysis of Real-Time Tasks
In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with… 
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)