In this paper, we are interested in modelization of some aspects of massively parallel computers built by connecting together copies of a unique given pattern. Thus, a natural and important question arises. Is it possible to verify that a property holds, not for one given configuration, but for all the configurations that can be constructed? Of course, the difficulty comes from the fact that the number of distinct configurations is infinite. We focus in this paper on the deadlock problem: can we verify that any net, constructed by connecting an arbitrary number of copies of the pattern, is deadlock free? As in a great number of models, the semantics of the pattern and thus the semantics of a net are given by finite transition systems. The main result of this paper proves that the deadlock problem is surprisingly undecidable.
[1]
Danièle Beauquier.
An Undecidable Problem About Rational Sets and Contour Words of Polyominoes
,
1991,
Inf. Process. Lett..
[2]
Antoine Petit,et al.
Detection of Deadlocks in an Infinite Family of Nets
,
1991,
STACS.
[3]
Orna Grumberg,et al.
Network Grammars, Communication Behaviors and Automatic Verification
,
1989,
Automatic Verification Methods for Finite State Systems.
[4]
Edmund M. Clarke,et al.
Avoiding the state explosion problem in temporal logic model checking
,
1987,
PODC '87.
[5]
A. Prasad Sistla,et al.
Reasoning with Many Processes
,
1987,
LICS.
[6]
Robert L. Berger.
The undecidability of the domino problem
,
1966
.