Sciweavers

37 search results - page 7 / 8
» Termination, Deadlock and Divergence
Sort
View
WSC
2004
13 years 7 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
JCS
2002
115views more  JCS 2002»
13 years 5 months ago
Panoptis: Intrusion Detection Using a Domain-Specific Language
We describe the use of a domain-specific language (DSL) for expressing critical design values and constraints in an intrusion detection application. Through the use of this specia...
Diomidis Spinellis, Dimitris Gritzalis
CONCUR
2005
Springer
13 years 11 months ago
Concurrent Clustered Programming
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
Vijay A. Saraswat, Radha Jagadeesan
ZEUS
2010
153views Communications» more  ZEUS 2010»
13 years 7 months ago
Estimating costs of a service
When designing a publicly available Web service, a service designer has to take care of costs and revenue caused by this services. In the very beginning possible partners might onl...
Christian Gierds, Jan Sürmeli
FUIN
2007
108views more  FUIN 2007»
13 years 5 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou