261 search results - page 14 / 53 » Detecting Temporal Logic Predicates on Distributed Computati... |
119
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
122
click to vote
EDOC
2008
IEEE
15 years 4 months ago
2008
IEEE
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+ , an extension to traditional...
146
Voted
PODC
1994
ACM
15 years 6 months ago
1994
ACM
We describe a method for writing assumption/guarantee specifications of concurrent systems. We also provide a proof rule for reasoning about the composition of these systems. Spec...
143
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Environmental monitoring applications present a challenge to current background subtraction algorithms that analyze the temporal variability of pixel intensities, due to the comple...
127
click to vote
AI
2008
Springer
15 years 2 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...