Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
Motivating students of the Nintendo generation for Computer Science can only be achieved by providing them with an exiting and fresh CS1 course. The article describes the experienc...
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Although there has been considerable research into ways to design visual programming environments to improve the processes of creating new programs and of understanding existing o...
Margaret M. Burnett, Andrei Sheretov, Gregg Rother...