Sciweavers

175 search results - page 3 / 35
» Partially Ordered Runs: A Case Study
Sort
View
AIIA
2005
Springer
13 years 11 months ago
Automata Slicing for Diagnosing Discrete-Event Systems with Partially Ordered Observations
Abstract. When dealing with real systems, it is unrealistic to suppose that observations can be totally ordered according to their emission dates. The partially ordered observation...
Alban Grastien, Marie-Odile Cordier, Christine Lar...
ASE
2004
167views more  ASE 2004»
13 years 5 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen
COR
2010
129views more  COR 2010»
13 years 3 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues
EWCBR
1998
Springer
13 years 9 months ago
Study and Formalization of a Case-Based Reasoning System Using a Description Logic
In this paper the C-CLASSIC Description Logic is used to design the retrieval and selection tasks of a Case-Based Reasoning system with homogeneous, explicit and formal criteria. T...
Sylvie Salotti, Véronique Ventos
KBSE
2007
IEEE
13 years 11 months ago
Ensuring consistency in long running transactions
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
Jeffrey Fischer, Rupak Majumdar