Progressing Collaborative Systems

Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov


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

Full Text:


Lululemon Black Friday cheap nfl jerseys Lululemon factory Outlet ny Black Friday discount tiffany outlet wholesale soccer jerseys online oakley black friday cheap nhl jerseys china cheap nfl jerseys north face black friday sale cheap nfl jerseys online Jordans Black Friday Sale 2015 Cheap Moncler Cyber Monday moncler outlet cheap soccer jerseys moncler outlet black friday cheap authentic nfl jerseys north face cyber monday Louboutin Black Friday canada wholesale cheap nfl jerseys lululemon cyber monday 2015 cheap nfl jerseys from china 2015 Cheap Moncler Black Friday Sale Moncler Cyber Monday 2015 cheap jerseys Lululemon Cyber Monday Sale jordans cyber monday deals 2015 cheap nike nfl jerseys Black Friday deals Lululemon 2015 jordan black friday 2015 Moncler Jackets Black Friday Sale 2015 Louboutin Pas Cher Black Friday 2015 Canada Lululemon north face black friday cheap wholesale soccer jerseys