Peter B. Henderson
Stony Brook University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Peter B. Henderson.
technical symposium on computer science education | 2003
Peter B. Henderson
We learned that valid deductive thinking begins with at least one universal premise and leads to a conclusion that is believed to be contained in the argument’s premises. Indeed, if the premises are true and the argument form is valid, the conclusion must be true. The universal statement in a syllogism allows us to move from a proposition about an entire class to a statement about some or all members of a class.
SIAM Journal on Computing | 1977
Peter B. Henderson; Yechezkel Zalcstein
Many of the process synchronization problems studied in the literature are of the form of a conjunction of finitely many conditions of the type “process
technical symposium on computer science education | 1989
Peter B. Henderson; Francisco Jose Romero
p_i
technical symposium on computer science education | 1990
Peter B. Henderson
blocks process
technical symposium on computer science education | 1986
Peter B. Henderson
p_j
technical symposium on computer science education | 2000
Charles Kelemen; Allen B. Tucker; Peter B. Henderson; Owen L. Astrachan; Kim B. Bruce
”. Such problems may be expressed as directed graphs whose nodes represent the processes and where there is an edge from node i to node j if and only if process
technical symposium on computer science education | 1987
Peter B. Henderson
p_i
SIAM Journal on Computing | 1982
John Keohane; John C. Cherniavsky; Peter B. Henderson
blocks process
technical symposium on computer science education | 2006
Peter B. Henderson; Rachelle DeCoste; Kevin Huggins
p_j
Journal of Educational Technology Systems | 1987
Peter B. Henderson
. We characterize the class of graphs which correspond to the system of synchronizing primitives of Vantilborgh and van Lamsweerde in terms of a normal form representation and present an efficient algorithm for determining whether an arbitrary graph is in this class.