Sciweavers

276 search results - page 19 / 56
» A Case Study in the Use of Theory Revision in Requirements V...
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
FOSSACS
2001
Springer
14 years 3 days ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
DAGSTUHL
2006
13 years 9 months ago
A Petri Net Approach to Verify and Debug Simulation Models
Verification and Simulation share many issues, one is that simulation models require validation and verification. In the context of simulation, verification is understood as the ta...
Peter Kemper, Carsten Tepper
AC
2003
Springer
14 years 26 days ago
Application of Coloured Petri Nets in System Development
Coloured Petri Nets (CP-nets or CPNs) and their supporting computer tools have been used in a wide range of application areas such as communication protocols, software designs, and...
Lars Michael Kristensen, Jens Bæk Jør...
DISOPT
2011
175views Education» more  DISOPT 2011»
12 years 11 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük