4218 search results - page 464 / 844 » Complete sets of cooperations |
181
click to vote
ENTCS
2008
15 years 7 months ago
2008
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
151
click to vote
FMSD
2008
15 years 7 months ago
2008
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
217
click to vote
FUIN
2008
15 years 7 months ago
2008
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal ...
162
click to vote
IIE
2008
15 years 7 months ago
2008
Abstract. Informatics is currently being taught in high schools all over the world. In the Netherlands, where all students are expected to become computer literate in the lower gra...
166
click to vote
FUIN
2006
15 years 7 months ago
2006
This paper is an attempt to incorporate the idea of spiking neurons into the area of membrane computing, and to this aim we introduce a class of neural-like P systems which we cal...