A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
We introduce an extension of the Parikh mapping called the Parikh ¢ -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represent...
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose op...
Abstract. We are developing a methodology of Test-Driven Development of Models (TDDM) based on an experimental UML2.0 modeling tool SMART. Our experience shows that TDDM is quite u...
Susumu Hayashi, Pan YiBing, Masami Sato, Kenji Mor...