ICALP
2000
Springer
13 years 8 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 8 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 8 months ago
2000
Springer
ICALP
2000
Springer
13 years 8 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...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
d Abstract) Christian Cachin1 , Jan Camenisch1 , Joe Kilian2 , and Joy M
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analys...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We extend the algebraic approach of Meseguer and Montanari from ordinary place/transition Petri nets to contextual nets, covering both the collective and the individual t...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer