Results 1  10
of
41
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
using finitely many realvalued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits
EventClock Visibly Pushdown Automata
"... Abstract. Eventclock automata is a determinizable subclass of timed automata, where the clock valuations are determined by the input instead of by the transition relation. In this note, we propose eventclock visibly pushdown automata (ECVPAs) as a proper extension of eventclock automata. The clas ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Eventclock automata is a determinizable subclass of timed automata, where the clock valuations are determined by the input instead of by the transition relation. In this note, we propose eventclock visibly pushdown automata (ECVPAs) as a proper extension of eventclock automata
Reducing quasiequal clocks in networks of timed automata
 In FORMATS
, 2012
"... Abstract. We introduce the novel notion of quasiequal clocks and use it to improve the verification time of networks of timed automata. Intuitively, two clocks are quasiequal if, during each run of the system, they have the same valuation except for those points in time where they are reset. We p ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. We introduce the novel notion of quasiequal clocks and use it to improve the verification time of networks of timed automata. Intuitively, two clocks are quasiequal if, during each run of the system, they have the same valuation except for those points in time where they are reset. We
As Cheap as Possible: Efficient CostOptimal Reachability for Priced Timed Automata
, 2001
"... In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal state in the model of Linearly Priced Timed Automata (LPTA). In recent papers, this problem have been shown to be computable using a priced extention of the traditional notion of regions for timed automat ..."
Abstract

Cited by 40 (11 self)
 Add to MetaCart
automata. However, for efficiency it is imperative that the computation is based on socalled zones (i.e. convex set of clock valuations) rather than regions. The central contribution of this paper is a priced extension of zones. This, together with a notion of facets of a zone, allows the entire machinery
Parameterized partition valuation for parallel logic simulation
 In Proc. of PDCN’97
, 1997
"... Parallelization of logic simulation on registertransfer and gate level is a promising way to accelerate extremely timeextensive system simulation processes during the design of whole processor structures. The background of this paper is given by the functional simulator parallelTEXSIM realizing si ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
simulation based on the clockcycle algorithm over looselycoupled parallel processor systems. In preparation for parallel cycle simulation, partitioning of hardware models is necessary, which essentially determines the e±ciency of the following simulation. We introduce a new method of parameterized
Efficiency with Linear Prices? A Theoretical and Experimental Analysis of the Combinatorial Clock Auction.
"... Combinatorial auctions have been suggested as a means to raise efficiency in multiitem negotiations with complementarities among goods as they can be found in procurement, energy markets, transportation, and the sale of spectrum auctions. The Combinatorial Clock (CC) auction has become very popular ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Combinatorial auctions have been suggested as a means to raise efficiency in multiitem negotiations with complementarities among goods as they can be found in procurement, energy markets, transportation, and the sale of spectrum auctions. The Combinatorial Clock (CC) auction has become very
Efficiency with Linear Prices? The Combinatorial Clock Auction and its Extensions.
"... The Combinatorial Clock (CC) design has a number of virtues, which made it the mechanism of choice in many practical combinatorial auctions. Ask prices are monotonously ascending, the ask price calculation is trivial, and the computationally hard winner determination is limited to the final stages o ..."
Abstract
 Add to MetaCart
The Combinatorial Clock (CC) design has a number of virtues, which made it the mechanism of choice in many practical combinatorial auctions. Ask prices are monotonously ascending, the ask price calculation is trivial, and the computationally hard winner determination is limited to the final stages
Synchronizing Words for Weighted and Timed Automata ∗
, 2014
"... The problem of synchronizing automata is concerned with the existence of a word that sends all states of the automaton to one and the same state. This problem has classically been studied for complete deterministic finite automata, with the existence problem being NLOGSPACEcomplete. In this paper w ..."
Abstract
 Add to MetaCart
we consider synchronizingword problems for weighted and timed automata. We consider the synchronization problem in several variants and combinations of these, including deterministic and nondeterministic timed and weighted automata, synchronization to unique location with possibly different clock
Synchronizing Words for Weighted and Timed Automata ∗
"... The problem of synchronizing automata is concerned with the existence of a word that sends all states of the automaton to one and the same state. This problem has classically been studied for complete deterministic finite automata, with the existence problem being NLOGSPACEcomplete. In this paper w ..."
Abstract
 Add to MetaCart
we consider synchronizingword problems for weighted and timed automata. We consider the synchronization problem in several variants and combinations of these, including deterministic and nondeterministic timed and weighted automata, synchronization to unique location with possibly different clock
Modular Discrete PseudoState Graphs for Time Petri Nets
"... Summary. This paper aims at extending modular state space analysis to time Petri nets. The basic model is time Petri nets, where the timing is a firing interval attached to each transition. They are here extended to allow for modules. A state is composed by both a marking and a clock valuation funct ..."
Abstract
 Add to MetaCart
Summary. This paper aims at extending modular state space analysis to time Petri nets. The basic model is time Petri nets, where the timing is a firing interval attached to each transition. They are here extended to allow for modules. A state is composed by both a marking and a clock valuation
Results 1  10
of
41