INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
We demonstrate how to apply Coupling from the Past, a simulation technique for exact sampling, to Markov chains based on TCP variants. This approach provides a new, statistically ...
ICTAC
2004
Springer
13 years 9 months ago
2004
Springer
Scenario based requirements specifications are the industry norm for defining communication protocols. Basic scenarios captured as UML sequence diagrams, Message Sequence Charts ...
CP
2004
Springer
13 years 9 months ago
2004
Springer
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...
TBILLC
2005
Springer
13 years 9 months ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the de...
CHARME
2005
Springer
13 years 10 months ago
2005
Springer
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. In this paper, we develop a partial order reduction algorithm for rule-bas...
APLAS
2005
ACM
13 years 10 months ago
2005
ACM
Message Sequence Charts (MSCs) are a graphical language for the description of scenarios in terms of message exchanges between communicating components in a distributed environment...
HYBRID
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We consider the dynamic feedback problem in a class of hybrid systems modeled as (infinite) state deterministic transition systems, in which the continuous variables are...
ISMVL
2008
IEEE
13 years 10 months ago
2008
IEEE
We investigate a class of metrics on lattices that are compatible with the partial order defined by the lattice using the ternary relation of betweenness that can be naturally de...
APN
2009
Springer
13 years 11 months ago
2009
Springer
In [LJ06] Lorenz and Juh´as raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets...
DCC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...