Sciweavers

528 search results - page 103 / 106
» Transition Logic Revisited
Sort
View
MEMOCODE
2003
IEEE
15 years 2 months ago
LOTOS Code Generation for Model Checking of STBus Based SoC: the STBus interconnect
In the design process of SoC (System on Chip), validation is one of the most critical and costly activity. The main problem for industrial companies like STMicroelectronics, stand...
Pierre Wodey, Geoffrey Camarroque, Fabrice Baray, ...
KESAMSTA
2009
Springer
15 years 2 months ago
Structural Changes in an Email-Based Social Network
ent Artificial Immune Systems (MAAIS) for Intrusion Detection: Abstraction from Danger Theory Chung-Ming Ou, C.R. Ou Ants-like Agents: a Model and Analysis Based on Natural Ants Be...
Krzysztof Juszczyszyn, Katarzyna Musial
INFOCOM
2000
IEEE
15 years 1 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
ECOOPW
1998
Springer
15 years 1 months ago
Mapping Business Processes to Software Design Artifacts
This paper explains the structure of a project repository, which enables you to trace business processes and business rules to the architecture and design of the software system. T...
Pavel Hruby
LICS
1994
IEEE
15 years 1 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka