Sciweavers

1019 search results - page 171 / 204
» Petri Net Transformations in the
Sort
View
DEDS
2007
104views more  DEDS 2007»
13 years 7 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
ETT
2000
149views Education» more  ETT 2000»
13 years 7 months ago
Channel Allocation with Recovery Strategy in Wireless Networks
With the increasing penetration of wireless communications systems, customers are expecting the same level of service, reliability and performance from the wireless communication s...
Yue Ma, James J. Han, Kishor S. Trivedi
RULEML
2009
Springer
14 years 2 months ago
Generation of Rules from Ontologies for High-Level Scene Interpretation
Abstract. In this paper, a novel architecture for high-level scene interpretation is introduced, which is based on the generation of rules from an OWL-DL ontology. It is shown that...
Wilfried Bohlken, Bernd Neumann
DOCENG
2010
ACM
13 years 8 months ago
Linking data and presentations: from mapping to active transformations
Modern GUI toolkits, and especially RIA ones, propose the concept of binding to dynamically link domain data and their presentations. Bindings are very simple to use for predefine...
Olivier Beaudoux, Arnaud Blouin
ISPD
1997
ACM
104views Hardware» more  ISPD 1997»
13 years 12 months ago
Timing driven placement in interaction with netlist transformations
In this paper, we present a new approach that performs timing driven placement for standard cell circuits in interaction with netlist transformations. As netlist transformations a...
Guenter Stenz, Bernhard M. Riess, Bernhard Rohflei...