Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
Naouel Moha, Sagar Sen, Cyril Faucher, Olivier Bar...
The premise of the work presented in this chapter is that much of the existing work on the generation of referring expressions has focused on aspects of the problem that appear to ...
Critical software most often requires an independent validation and verification (IVV). IVV is usually performed by domain experts, who are not familiar with specific, many times ...
Series Parallel (SP) digraphs are a common method of representing instructions with partially ordered actions, but not always an ideal one, as relationships among groups of action...