Sciweavers

5356 search results - page 208 / 1072
» Adventures in time and space
Sort
View
ICTAC
2005
Springer
16 years 3 days ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang
WECWIS
2003
IEEE
85views ECommerce» more  WECWIS 2003»
15 years 12 months ago
A Tractable Mechanism for Time Dependent Markets
Markets with time dependent goods are special cases of multi commodity markets.The design of large flexible markets with time dependent goods is a computational challenge. In thi...
Per Carlsson, Arne Andersson, Fredrik Ygge
DAC
1996
ACM
15 years 10 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin
ATS
2001
IEEE
137views Hardware» more  ATS 2001»
15 years 10 months ago
Compaction Schemes with Minimum Test Application Time
Testing embedded cores in a System-on-a-chip necessitates the use of a Test Access Mechanism, which provides for transportation of the test data between the chip and the core I/Os...
Ozgur Sinanoglu, Alex Orailoglu
FMSB
2008
130views Formal Methods» more  FMSB 2008»
15 years 8 months ago
Approximating Continuous Systems by Timed Automata
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...
Oded Maler, Grégory Batt