8486 search results - page 1364 / 1698 » Ordered Enumeration Method |
204
click to vote
APSEC
1996
IEEE
15 years 11 months ago
1996
IEEE
Testing of concurrent programs is much more difficult than that of sequential programs. A concurrent program behaves nondeterministically, that is, the program may produce differe...
173
click to vote
ARTS
1997
Springer
15 years 11 months ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
171
click to vote
ECOOP
1997
Springer
15 years 11 months ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
199
click to vote
ICFEM
1997
Springer
15 years 11 months ago
1997
Springer
A real-time computer system is a system that must perform its functions within specified time bounds. These systems are generally characterized by complex interactions with the en...
179
click to vote
ISSAC
1997
Springer
15 years 11 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...