ICALP
2000
Springer
13 years 11 months ago
2000
Springer
This report presents a formal approach to reducing sequences in PEPA components. Performing the described amalgamation procedure we may remove, from the underlying Markov chain, t...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
The Unified Modeling Language UML is a rich language so that it seem not feasible to give a single semantics for the complete language in one ste In order to define the semantics,...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniq...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Graph processes are used in order to formalize the relation between global requirement specifications of multi-agent systems by means of message sequence charts, and implementatio...