Day: July 25, 2019

Welcome and Invite to Reunion Celebration on Friday, August 2

Adrienne Minerick

Dear Alumni, Colleagues and Friends,

Welcome to Michigan Tech’s new College of Computing! By now you’ve received the latest Michigan Tech magazine and have read the announcement of Michigan Tech’s newest college. This is an exciting time at Michigan Tech as we reimagine existing programs, add new majors, and pursue innovative new initiatives to prepare our graduates—and Michigan Tech—for Industry 4.0!

As you saw in the magazine, Michigan Tech embraces an exciting, diverse learning and research community. Computing and information science are an essential part of it all. Computing skills and computational thinking are essential in virtually all fields and job markets today, and Michigan Tech’s College of Computing is in position to ensure all our graduates are prepared, comfortable, and agile in a world in which cyber-technologies influence virtually everything.

The new College of Computing (CC) merges a talented, forward-thinking, innovative group of faculty and staff. We oversee core undergraduate degrees in Computer Network and System Administration (CNSA), Computer Science, Cybersecurity, Electrical Engineering Technology, and Software Engineering, with minors in Computer Science, Cybersecurity, and Data Acquisition and Industrial Control.  Our graduate degrees include Computer Science (MS and PhD), Cybersecurity, Data Science, Health Informatics, and Mechatronics. On the research front, CC faculty and students are developing innovative software and hardware solutions to address today’s societal, technological, and sustainable challenges. Visit to learn more.

I am pleased to introduce myself as the founding Dean of the College of Computing, effective July 1, 2019. It is an honor to help launch the College of Computing and assist in positioning Michigan Tech for this new era.

By way of my background, I am a chemical engineering BS graduate of Michigan Tech (’98); I completed my MS and PhD in Chemical & Biomolecular Engineering at the University of Notre Dame du lac (USA). I returned to Michigan Tech in 2010, and am currently a Professor of Chemical Engineering. I have also served the University as Associate Dean for Research and Innovation for the College of Engineering, Assistant to the Provost for Faculty Development, and Dean of the School of Technology.

As you may know, Michigan Tech’s Alumni Reunion is just around the corner, August 1-3, 2019. Graduates from all years and majors are welcome, and we sincerely hope to reconnect with many of you—our computing/software and electronics/robotics alumni!

At a special celebration Friday, August 2, 1:00 to 4:00 p.m., we’ll be sharing additional information about the College of Computing, and showing off some of our senior design projects. It is our hope that you’ll gain a few new and fun memories at this event.  Please join us outside Rekhi Hall (weather permitting) or on the second floor of Rekhi Hall for this wonderful opportunity to catch up with everyone and share your best—and perhaps even some of your worst—Michigan Tech memories! Ice cream and light refreshments will be served. The event is free and guests and family members are welcome.

Please let us know if you’re able to attend this College of Computing event, and register for the Reunion, at We look forward to seeing you in Houghton!

Best regards,

Adrienne Minerick, PhD

Dean, College of Computing

Ali Ebnenasir is Co-Author of Publication in ACM Transactions on Computational Logic

Ali Ebnenasir
Ali Ebnenasir

An article co-authored by Ali Ebnenasir (SAS/CS) and Alex Klinkhamer, “Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings,” was recently published in ACM Transactions on Computational Logic.

Abstract: This article investigates the verification of livelock-freedom and self-stabilization on parameterized rings consisting of symmetric, constant space, deterministic, and self-disabling processes. The results of this article have a significant impact on several fields, including scalable distributed systems, resilient and self-* systems, and verification of parameterized systems. First, we identify necessary and sufficient local conditions for the existence of global livelocks in parameterized unidirectional rings with unbounded (but finite) number of processes under the interleaving semantics. Using a reduction from the periodic domino problem, we show that, in general, verifying livelock-freedom of parameterized unidirectional rings is undecidable (specifically, Π10-complete) even for constant space, deterministic, and self-disabling processes. This result implies that verifying self-stabilization for parameterized rings of self-disabling processes is also undecidable. We also show that verifying livelock-freedom and self-stabilization remain undecidable under (1) synchronous execution semantics, (2) the FIFO consistency model, and (3) any scheduling policy. We then present a new scope-based method for detecting and constructing livelocks in parameterized rings. The proposed semi-algorithm behind our scope-based verification is based on a novel paradigm for the detection of livelocks that totally circumvents state space exploration. Our experimental results on an implementation of the proposed semi-algorithm are very promising as we have found livelocks in parameterized rings in a few microseconds on a regular laptop. The results of this article have significant implications for scalable distributed systems with cyclic topologies.

doi: 10.1145/3326456