Sciweavers

130 search results - page 2 / 26
» Decidability Problems of a Basic Class of Object Nets
Sort
View
ICPR
2004
IEEE
14 years 5 months ago
Probabilistic Classification Between Foreground Objects and Background
Tracking of deformable objects like humans is a basic operation in many surveillance applications. Objects are detected as they enter the field of view of the camera and they are ...
Paul J. Withagen, Klamer Schutte, Frans C. A. Groe...
APN
2007
Springer
13 years 11 months ago
Nets with Tokens Which Carry Data
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...
Ranko Lazic, Thomas Christopher Newcomb, Joël...
APN
2008
Springer
13 years 6 months ago
Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
Morgan Magnin, Didier Lime, Olivier H. Roux
EOR
2006
103views more  EOR 2006»
13 years 4 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
STACS
2007
Springer
13 years 11 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman