151
Voted
ANSS
1991
IEEE
15 years 8 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
148
click to vote
AGP
1994
IEEE
15 years 8 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
172
click to vote
ANSS
1991
IEEE
15 years 8 months ago
1991
IEEE
The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critica...
170
click to vote
AMAST
1991
Springer
15 years 8 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...