Max Kanovich - University College London, UCL-CS, UK,
Tajana Ban Kirigin - Queen Mary, University of London
Vivek Nigam - Federal University of Para´ıba, Brazil
Andre Scedrov - University of Pennsylvania, USA

This paper builds on existing multiset rewriting models for collaborative systems. We formalize Progressing Collaborative Systems by restricting repetitions of actions. Namely, we consider processes where instances of actions are used only a bounded number of times. Administrative processes usually involve such progressing behavior, i.e. whenever a transaction is performed, it does not need to be repeated. We investigate the complexity of the reachability problem and the planning problem for Progressing Collaborative Systems that may create fresh values. We show that these problems are NP-complete when actions are balanced and the size of facts is bounded.

Computational Complexity, NP-completeness, Collaborative Systems, Progressing, Fresh Values