AWPN
2008
14 years 1 months ago
2008
We introduce a Janus-faced reference net component that presents the basis for the recursive composition of complex systems from open system units. We particularly focus on the ope...
AWPN
2008
14 years 1 months ago
2008
In this paper we investigate synthesis of place/transition Petri nets from three different finite representations of infinite partial languages, generalizing previous results.
AWPN
2008
14 years 1 months ago
2008
When adapting services in a SOA environment, not only the validity of the adapter may be of importance, but also non-functional properties like the costs of the adapter. We introdu...
AWPN
2008
14 years 1 months ago
2008
We calculate a fixed finite set of state space fragments for a service P, where each fragment carries a part of the whole behavior of P. By composing these fragments according to t...
AWPN
2008
14 years 1 months ago
2008
AWPN
2008
14 years 1 months ago
2008
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
ALENEX
2007
14 years 1 months ago
2007
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
ALENEX
2007
14 years 1 months ago
2007
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
ALENEX
2007
14 years 1 months ago
2007
ALENEX
2007
14 years 1 months ago
2007
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...