Sciweavers

524 search results - page 32 / 105
» Temporal reachability graphs
Sort
View
AIML
2006
13 years 11 months ago
Dynamic topological logics over spaces with continuous functions
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
Boris Konev, Roman Kontchakov, Frank Wolter, Micha...
ICIP
2010
IEEE
13 years 7 months ago
Semi-supervised regression with temporal image sequences
We consider a semi-supervised regression setting where we have temporal sequences of partially labeled data, under the assumption that the labels should vary slowly along a sequen...
Ling Xie, Miguel Á. Carreira-Perpiñ&...
FUIN
2007
123views more  FUIN 2007»
13 years 9 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 10 months ago
Longest paths in Planar DAGs in Unambiguous Logspace
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
ICINCO
2009
132views Robotics» more  ICINCO 2009»
13 years 7 months ago
Discrete Event Diagnosis using Petri Nets
This paper serves as a support for the plenary address given by the second author during the conference. In this paper we present an approach to on-line diagnosis of discrete even...
Maria Paola Cabasino, Alessandro Giua, Carla Seatz...