Sciweavers

ICALP
2000
Springer
14 years 3 months ago
Amalgamation of Transition Sequences in the PEPA Formalism
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...
Jane Hillston, J. Tomasik
ICALP
2000
Springer
14 years 3 months ago
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
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...
Jesper G. Henriksen, Madhavan Mukund, K. Narayan K...
ICALP
2000
Springer
14 years 3 months ago
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
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...
Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, ...
ICALP
2000
Springer
14 years 3 months ago
Graph Transformations on the UML Metamodel
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,...
Martin Gogolla
ICALP
2000
Springer
14 years 3 months ago
Reasoning about Idealized ALGOL Using Regular Languages
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 ...
Dan R. Ghica, Guy McCusker
ICALP
2000
Springer
14 years 3 months ago
A New Unfolding Approach to LTL Model Checking
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...
Javier Esparza, Keijo Heljanko
ICALP
2000
Springer
14 years 3 months ago
Computing the Girth of a Planar Graph
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...
Hristo Djidjev
ICALP
2000
Springer
14 years 3 months ago
Formalizing the Development of Agent-Based Systems Using Graph Processes
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...
Ralph Depke, Reiko Heckel