Sciweavers

689 search results - page 87 / 138
» A Modal-Logic Based Graph Abstraction
Sort
View
RANDOM
1998
Springer
13 years 12 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
ASWEC
2005
IEEE
14 years 1 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
JSA
2008
131views more  JSA 2008»
13 years 7 months ago
Formal verification of ASMs using MDGs
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describ...
Amjad Gawanmeh, Sofiène Tahar, Kirsten Wint...
ICTAI
2010
IEEE
13 years 5 months ago
Multicriteria Reasoning Considering Reliability or Availability
Abstract--Reliability and/or availability are increasingly important aspects in the design of systems, especially networks and service offerings. Optimization here is a multi-crite...
Tarik Hadzic, Helmut Simonis
ICRA
2005
IEEE
115views Robotics» more  ICRA 2005»
14 years 1 months ago
Language-based Feedback Control Using Monte Carlo Sensing
Abstract— Landmark-based graphs are a useful and parsimonious tool for representing large scale environments. Relating landmarks by means of feedback-control algorithms encoded i...
Sean B. Andersson, Dimitrios Hristu-Varsakelis