Sciweavers

1671 search results - page 212 / 335
» On the Covering Steiner Problem
Sort
View
ENTCS
2008
95views more  ENTCS 2008»
15 years 6 months ago
A Rule-based Method to Match Software Patterns Against UML Models
In a UML model, different aspects of a system are covered by different types of diagrams and this bears the risk that an overall system specification becomes barely tractable by t...
Demis Ballis, Andrea Baruzzo, Marco Comini
FMSD
2008
94views more  FMSD 2008»
15 years 6 months ago
Optimal infinite scheduling for multi-priced timed automata
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...
IANDC
2008
87views more  IANDC 2008»
15 years 6 months ago
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
DSP
2006
15 years 6 months ago
Detection of audio covert channels using statistical footprints of hidden messages
We address the problem of detecting the presence of hidden messages in audio. The detector is based on the characteristics of the denoised residuals of the audio file, which may c...
Hamza Özer, Bülent Sankur, Nasir D. Memo...
ENTCS
2006
94views more  ENTCS 2006»
15 years 6 months ago
Reasoning About Partial Functions in the Formal Development of Programs
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...
Cliff B. Jones