Sciweavers

2713 search results - page 99 / 543
» Parameterized Tree Systems
Sort
View
CONCUR
2006
Springer
15 years 2 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
ICPPW
2002
IEEE
15 years 5 months ago
A Structural Framework for Modeling Multi-Stage Network Attacks
Incidents such as Solar Sunrise and Nimda demonstrate the need to expressively model distributed and complex network attacks. To protect information systems, system administrators...
Kristopher Daley, Ryan Larson, Jerald Dawkins
SE
2007
15 years 2 months ago
Rules for type-checking of parametric polymorphism in EMF generics
Abstract: The Eclipse infrastructure for modeling is based on EMF, an implementation of Essential MOF, the OMG standard for metamodeling. A recent addition to EMF has been parametr...
Miguel Garcia
HIPC
2003
Springer
15 years 6 months ago
POMA: Prioritized Overlay Multicast in Ad Hoc Environments
Abstract: Overlay Multicast networks in mobile ad-hoc environments have received much attention due to their increasing number of practical applications. Although overlay multicast...
Abhishek P. Patil, Yunhao Liu, Lionel M. Ni, Li Xi...
EJC
2000
15 years 2 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda