Sciweavers

2583 search results - page 90 / 517
» On the Representation of Timed Polyhedra
Sort
View
LREC
2010
115views Education» more  LREC 2010»
15 years 7 months ago
A General Methodology for Equipping Ontologies with Time
In the first part of this paper, we present a framework for enriching arbitrary upper or domain-specific ontologies with a concept of time. To do so, we need the notion of a time ...
Hans-Ulrich Krieger
VLSID
1999
IEEE
91views VLSI» more  VLSID 1999»
15 years 10 months ago
Timed Circuit Synthesis Using Implicit Methods
The design and synthesis of asynchronous circuits is gaining importance in both the industrial and academic worlds. Timed circuits are a class of asynchronous circuits that incorp...
Robert Thacker, Wendy Belluomini, Chris J. Myers
SSD
2001
Springer
122views Database» more  SSD 2001»
15 years 10 months ago
Calendars, Time Granularities, and Automata
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, t...
Ugo Dal Lago, Angelo Montanari
IAT
2009
IEEE
16 years 1 months ago
A New Semantics of Social Commitments Using Branching Space-Time Logic
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
Mohamed El-Menshawy, Jamal Bentahar, Rachida Dssou...
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 10 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer