130 search results - page 15 / 26 » Decidability Problems of a Basic Class of Object Nets |
FLOPS
2006
Springer
13 years 11 months ago
2006
Springer
Functional reactive programming integrates dynamic dataflow with functional programming to offer an elegant and powerful model for expressing computations over time-varying values....
CAV
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
CVIU
2011
12 years 11 months ago
2011
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
ISKI
1994
13 years 11 months ago
1994
There is a manifold of meanings we could associate with the term \evolution" in the database arena. This paper tries to categorize some of these into a unique framework, showi...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...