Travelling salesman problem in tissue P systems with costs

We define tissue P systems with costs assigning execution costs to the synapses that are used to transport the objects between cells. We use the Priced-Timed Maude rewriting engine to provide an implementation of tissue P systems with costs. The implementation allows us to analyze and verify some behavioural aspects of tissue P systems with costs. We illustrate an application of these tissue P systems with costs by providing a solution to the Travelling Salesman Problem.