Rodney R. Howell
December, 2021
 Educational Background:

Ph.D. Computer Science (May, 1988),
University of Texas at Austin
B.S. Computer Science (May, 1984),
Wichita State University
 Refereeing Activities Performed for:

Transactions on Algorithms, Advances in Petri Nets,
Fundamenta Informaticae, Performance
Evaluation, RealTime Systems, IEEE Trans. on Parallel and
Distributed Systems, Information Processing Letters, IEEE
Trans. in Automatic Control, IEEE Computer, IEEE Trans. on
Software Engineering, IEEE Trans. on Computers, Acta
Informatica, SIAM Journal on Computing,
RealTime Systems Symposium, International
Conference on Distributed
Computer Systems, Symposium on Partial Evaluation and SemanticsBased
Program Manipulation, International Conference on Application and Theory
of Petri Nets, Symposium on Applied Computing, International
Conference on Parallel and Distributed Systems, Mathematical
Foundations of Computer Science, Euromicro Conference on RealTime
Systems, and ACM Computer
Science Conference.
 Fellowships and Awards:

Kansas State Scholarship (19801984)
McGregor Scholarship (19801984)
Microelectronics and Computer Development Fellowship (19841986)
GTE Fellowship (1987)
 Areas of Research Interest:

RealTime Systems,
Selfstabilization,
Petri Nets,
Process Planning Networks,
Graph Algorithms,
Computational Complexity,
Theory of Computation, and
Temporal Logic
 Employment History

 1988present:

Associate Professor, Department of Computing and Information Sciences,
Kansas State University.
 August 2014present: Undergraduate Programs Director
 August 2019June 2020: Special Assistant to the Dean
 1988:

Research Fellow, Department of Computer Sciences, The
University of Texas at Austin.
 19861988:

Research Assistant, Department of Computer Sciences, The
University of Texas at Austin.
 19851987:

Teaching Assistant, Department of Computer Sciences, The
University of Texas at Austin.
 19821984:

User Services Consultant, Digital Computing Center, Wichita State University.
 19821983:

Student Assistant, Computer Science Department, Wichita State University.

M.S. Students:
 Muralidhar K. Venkatrao, Date of Completion: June, 1991.
 Thiagarajan Rajagopalan, Date of Completion: July, 1993.
 Pamela Hsu, Date of Completion: August, 1994.
 Xiaodong Wang, Date of Completion: July, 1996.
 Yan Zhou, Date of Completion: August, 1997.
 Varsha Mahadevan, Date of Completion: December, 2002.
 Vineet Tadakamalla, Date of Completion: May, 2011.
Grants and Contracts:
 Joint Study Contract Between Hitachi, Ltd., and KSU, (with
M. Mizuno), $173,685, January 1, 2008  December 31,
2008, to conduct research on a realtime operating
system and device drivers for control programs for
automotive systems.
 ``Software Control Laboratory,'' NSF Grant No. DUE9351911 (with
D. Gustafson, M. Calhoun, M. Mizuno, and V. Wallentine), $31,202,
with matching funds from KSU, June 1, 1993  November 30, 1995, to
equip a laboratory to be used for programming exercises in several
undergraduate courses and for seniorlevel projects and honors
students. The equipment includes two mobile robots, a stationary
robotic arm, and other hardware and software support.
Survey Articles:
 Feasibility Problems for Recurring Tasks on
One Processor (with
S. Baruah and L. Rosier), Theoretical
Computer Science 118 (1993), pp. 320.
 Recent Results on the Complexity of Problems Related to Petri Nets
(with L. Rosier),
Advances in Petri Nets 1987, LNCS 266,
pp. 4572,
Rozenberg, G., Ed., (Springer, Berlin, 1987).
Journal Articles/Submissions:
 FiniteState SelfStabilizing Protocols in MessagePassing
Systems (with M. Nesterenko and M. Mizuno),
Journal of Parallel and Distributed
Computing 62 (2002), special issue on
SelfStabilizing Distributed Systems, pp. 792817.

On NonPreemptive Scheduling of Recurring
Tasks Using Inserted
Idle Times
(with M. Venkatrao), Information and
Computation 117
(1995), pp. 5062.
 The Complexity of Problems Concerning Structurally Bounded and
Conservative Petri
Nets,
Information Processing Letters 39 (1991), pp. 309315.
 Bounded SelfStabilizing Petri
Nets (with L. Cherkasova and L.
Rosier), Acta Informatica 32 (1995), pp. 189207.
A similar version has appeared in
Advances in Petri Nets 1993, LNCS 674, pp. 2650,
Rozenberg, G., Ed., (Springer, Berlin, 1993).
 Completeness Results for SinglePath Petri
Nets (with P.
Jancar and L. Rosier),
Information and
Computation 106 (1993),
pp. 253265.
 Algorithms and Complexity Concerning the Preemptive Scheduling
of Periodic, RealTime Tasks on One Processor (with S. Baruah and L.
Rosier), RealTime Systems 2 (1990), pp. 301324.
 The Instability of SelfStabilization
(with M. Gouda and L. Rosier),
Acta Informatica 27 (1990), pp. 697724.
 Normal and Sinkless Petri Nets
(with L. Rosier and H. Yen),
Journal of Computer and System Sciences 46 (1993), pp. 126.
 A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets
(with L. Rosier and H. Yen),
Theoretical Computer Science 82 (1991), pp. 341372.
 Global and Local Views of State Fairness
(with L. Rosier and H. Yen),
Theoretical Computer Science 80 (1991), pp. 77104.
 Problems Concerning Fairness and Temporal Logic for
ConflictFree Petri Nets (with L. Rosier),
Theoretical Computer Science 64 (1989), pp. 305329.
A similar version of this paper has appeared
under the title,
On
Questions of Fairness and Temporal Logic for ConflictFree
Petri Nets,
in Advances in Petri Nets 1988, LNCS 340, pp. 200226,
Rozenberg, G., Ed., (Springer, Berlin, 1988).
 Completeness Results for ConflictFree Vector
Replacement Systems
(with L. Rosier),
Journal of Computer and System Sciences 37 (December 1988),
pp. 349366.
 An O(n^{1.5})
Algorithm to Decide Boundedness for ConflictFree Vector
Replacement Systems
(with L. Rosier and H. Yen),
Information Processing Letters 25 (April 1987), pp. 2733.
 Some Complexity Bounds for Problems Concerning Finite
and 2Dimensional Vector Addition Systems with States
(with L. Rosier, D. Huynh, and H. Yen),
Theoretical Computer Science 46 (1986), pp. 107140.
 An Analysis of the Nonemptiness Problem for Classes of ReversalBounded
Multicounter Machines
(with L. Rosier),
Journal of Computer and System Sciences 34 (February 1987), pp. 5574.
Conference Articles:
 Computing FirsttoFirst Propagation Delays Through Sequences of
FixedPriority Periodic Tasks, in the Proceedings
of the 24th Euromicro Conference on RealTime Systems,
pp. 343352,
Pisa, Italy, July 2012.
 Propagation Delays in FixedPriority Scheduling of Periodic Tasks
(with M. Mizuno), in the Proceedings of the 22nd
Euromicro Conference on RealTime Systems, pp. 219228,
Brussels, Belgium, July 2010.
 Using Graph Drawings to Find Short Paths in Large Graphs (with
T. Weninger and W. Hsu), in
Proceedings of the 2009 International Conference on
Artificial Intelligence, Las
Vegas, Nevada, July 2009.
 FiniteState SelfStabilizing Protocols in
MessagePassing
Systems (with
M. Nesterenko and M. Mizuno), in the Proceedings of the 19th
ICDCS Workshop on SelfStabilizing Systems, pp. 6269, Austin, Texas,
June 1999.
 An Integrated Environment for FeatureBased Design and Process
Planning for Turned Components (with S. Sayani, J. Lazcano, and P.
Krishnaswami), in the Proceedings of the 22nd Midwest Mechanics
Conference, pp. 330331, Rolla, Missouri, October 1991.
 SinglePath Petri Nets (with P. Jancar and L. Rosier), in
the Proceedings of the 16th International Symposium on Mathematical
Foundations of Computer Science, LNCS 520, pp. 202210, Kazimierz
Dolny, Poland, September 1991.
 Bounded SelfStabilizing Petri Nets (with L. Cherkasova and L.
Rosier), in the Proceedings of the 12th International Conference on
Application and Theory of Petri Nets, pp. 4261, Gjern, Denmark, June 1991.
 On Preemptive Scheduling of Periodic, RealTime Tasks on One
Processor (with S. Baruah and L. Rosier), in the Proceedings of the
15th International Symposium on Mathematical Foundations of Computer
Science, LNCS 452, pp. 173179, Banská Bystrica, Czechoslovakia,
August 1990.
 System Simulation and the Sensitivity of SelfStabilization
(with M. Gouda and L. Rosier), in the Proceedings of the 14th
International Symposium on Mathematical Foundations of Computer
Science, LNCS 379, pp. 249258, Porabka Kozubnik, Poland,
AugustSeptember 1989. A similar version also appeared under the
title, The Instability of SelfStabilization, in the
Proceedings of the MCC Workshop on SelfStabilizing Systems, MCC
Technical Report No. STP37989, Michael Evangelist and Shmuel Katz
Eds., Austin, Texas, August 1989.
 Normal and Sinkless Petri Nets (with L. Rosier and H. Yen), in
the Proceedings of the 7th International Conference on Fundamentals
of Computation Theory, LNCS 380, pp. 234243, Szeged, Hungary, August 1989.
 A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets
(with L. Rosier and H. Yen),
in the Proceedings of the
13th International Symposium on Mathematical Foundations of Computer
Science, LNCS 324,
pp. 351359,
Carlsbad, Czechoslovakia, August, 1988.
 Completeness Results for Reachability, Containment, and Equivalence, with
Respect to ConflictFree Vector Replacement Systems
(with L. Rosier),
in the Proceedings of the
14th International Colloquium on Automata, Languages, and Programming,
LNCS 267, pp. 509520,
Karlsruhe, West Germany, July 1987.
 On Questions of Fairness and Temporal Logic for ConflictFree Petri Nets
(with L. Rosier),
in the Proceedings of the
8th European Workshop on Applications and Theory of Petri Nets,
pp. 197214,
Zaragoza, Spain, June 1987.
 On the Complexity of Containment, Equivalence, and Reachability for
Finite and 2Dimensional Vector Addition Systems with States (with D. Huynh,
L. Rosier, and H. Yen),
in the Proceedings of the 4th Annual
Symposium on Theoretical Aspects of Computer
Science, LNCS 247, pp. 360370, Passau, West Germany, February
1987.
 On Global vs. Local State Fairness (with L. Rosier and H. Yen),
in the Proceedings of the
24th Annual Allerton Conference on Communication,
Control, and Computing, pp. 721729,
Allerton House, Monticello, Illinois, October
1986.
 An Analysis of the Nonemptiness Problem for Classes of ReversalBounded
Multicounter Machines (with L. Rosier), in the
Proceedings of the
12th International Symposium on Mathematical Foundations of Computer
Science, LNCS 233, pp. 422430, Bratislava, Czechoslovakia, August 1986.
Other Papers:
 On
Asymptotic Notation with Multiple
Variables, KSU Technical Report 20074
(revised Jan. 18, 2008).
Books:

Algorithms:
A TopDown Approach, to be published
by World
Scientific.
Invited Talks:
 Scheduling Problems Involving Both Deadlines and Accuracy,
Hitachi Central Research Laboratory, August 1, 2008.
 Optimal Scheduling and Handling Potential Overload, University
of NebraskaLincoln, October 28, 1993.
 On Nonpreemptive Scheduling of Recurring Tasks Using Inserted
Idle Time, The University of Texas at Austin, August 4, 1992.
 System Simulation and the Sensitivity of SelfStabilization,
Iowa State University, November 9, 1989.
 The Complexity of Problems Concerning ConflictFree Petri Nets,
an interview talk given at the following universities during March and
April, 1988:
Southern Methodist University, Kansas State University, The Wichita
State University, State University of New York at Buffalo, Texas A&M,
Washington University (St. Louis), and The University of Missouri at
Rolla.
Rod Howell (rhowell@ksu.edu)