Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized

2018 ◽  
pp. 194-206 ◽  
Author(s):  
Pallavi Jain ◽  
Lawqueen Kanesh ◽  
Pranabendu Misra
Keyword(s):  
Covering Problems

Hyperbolic set covering problems with competing ground-set elements

2011 ◽  
Vol 134 (2) ◽  
pp. 323-348 ◽  
Author(s):  
Edoardo Amaldi ◽  
Sandro Bosio ◽  
Federico Malucelli
Keyword(s):  
Set Covering ◽  
Covering Problems ◽  
Set Covering Problems ◽  
Hyperbolic Set

Mapping OWL-S Process Model to Timed Automata

2018 ◽  
Vol 11 (1) ◽  
pp. 29-48
Author(s):  
Amel Boumaza ◽  
Ramdane Maamri
Keyword(s):  
Web Services ◽  
Process Model ◽  
Timed Automata ◽  
Automatic Verification ◽  
Covering Problems ◽  
Field Verification ◽  
Starting Point ◽  
Quantitative Properties ◽  
Time Systems

The conversion of web services to semantic web comes the opportunity to automate various tasks. OWL-S plays a key role in describing web services behaviour. While ontology-based semantics given to OWL-S is structural rather than behaviourally oriented, we cannot automate an essential task in this field, verification. In this article, the mapping of OWL-S process model to Timed automata is investigated, which is a suitable formalism for real time systems modeling and automatic verification. Hence, this has led to not only enabling automatic verification but also covering problems related to automated verification of temporal quantitative properties as bounded liveness property. As a starting point, the OWL-S and sub entry of time ontologies for describing the timed behaviour of services has been chosen. A defined set of mapping rules is used to automatically encode control constructs defined in OWL-S and temporal information into timed automata. Also, it is shown how a Uppaal checker is used to check required properties formulated in TCTL. Finally, an EClinic case study is used to illustrate the technique.

On Covering Problems of Rado

Algorithmica ◽  
2009 ◽  
Vol 57 (3) ◽  
pp. 538-561 ◽  
Author(s):  
Sergey Bereg ◽  
Adrian Dumitrescu ◽  
Minghui Jiang
Keyword(s):  
Covering Problems

General Formulation of Fault Covering Problems

1992 ◽  
pp. 91-117
Author(s):  
Ran Libeskind-Hadas ◽  
Nany Hasan ◽  
Jason Cong ◽  
Philip K. McKinley ◽  
C. L. Liu
Keyword(s):  
Covering Problems

Finite Covering Problems

1983 ◽  
pp. 112-139
Author(s):  
Ronald E. Prather
Keyword(s):  
Finite Covering ◽  
Covering Problems
Sign in / Sign up

Export Citation Format

Share Document