Decidability and Tractability of Problems in Object-Based Graph Grammars [chapter]

Aline Brum Loreto, Leila Ribeiro, Laira Vieira Toscani
2002 Foundations of Information Technology in the Era of Network and Mobile Computing  
Object-based programming languages are being widely used to construct concurrent and distributed systems. In such systems, the complexity of performing some task is usually measured in terms of messages that are exchanged to perform the task, because communication is almost always the most time consuming operation in these environments. In this paper we analyze the problem of verifying if a message can be delivered. We model object-based systems as a graph grammars, and analyze this property as
more » ... a graph grammar property. It turns out that this problem is NP-Hard. With suitable restrictions on the kind of graph grammar rules that are used, decidability can also be proven.
doi:10.1007/978-0-387-35608-2_33 dblp:conf/ifipTCS/LoretoRT02 fatcat:7zax3nvw5ndbljrgvxralrlvqm