3653 search results - page 283 / 731 » On Recognizable Timed Languages |
166
click to vote
SAS
1993
Springer
15 years 11 months ago
1993
Springer
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
253
click to vote
KR
1991
Springer
15 years 11 months ago
1991
Springer
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
184
click to vote
ACSD
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...
200
click to vote
ENTCS
2007
15 years 7 months ago
2007
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
189
click to vote
ICSE
2005
IEEE-ACM
16 years 7 months ago
2005
IEEE-ACM
To achieve the goalof realizingobject adaptationto environments, a new role-based model Epsilon and a language EpsilonJ is proposed. In Epsilon, an environment is defined as a fie...