Naslov
A Rewriting Framework for Activities Subject to Regulations

Autori
Kanovich, Max ; Ban Kirigin, Tajana ; Nigam, Vivek ; Scedrov, Andre ; Talcott, Carolyn ; Perović, Ranko

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
23rd International Conference on Rewriting Techniques and Applications (RTA'12) : proceedings / Ashish Tiwari - Wadern : Leibniz : Zentrum fuer Informatik, 2012, 305-322

ISBN
978-3-939897-38-5

Skup
International Conference on Rewriting Techniques and Applications (23 ; 2012)

Mjesto i datum
Nagoya, Japan, 28.05.2012. - 02.06.2012

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Multiset Rewrite Systems ; Collaborative Systems ; Applications of Rewrite Systems ; Clinical Investigations ; Maude

Sažetak
Activities such as clinical investigations or financial processes are subject to regulations to ensure quality of results and avoid negative consequences. Regulations may be imposed by multiple governmental agencies as well as by institutional policies and protocols. Due to the complexity of both regulations and activities there is great potential for violation due to human error, misunderstanding, or even intent. Executable formal models of regulations, protocols, and activities can form the foundation for automated assistants to aid planning, monitoring, and compliance checking. We propose a model based on multiset rewriting where time is discrete and is specified by timestamps attached to facts. Actions, as well as initial, goal and critical states may be constrained by means of relative time constraints. Moreover, actions may have non-deterministic effects, that is, they may have different outcomes whenever applied. We demonstrate how specifications in our model can be straightforwardly mapped to the rewriting logic language Maude, and how one can use existing techniques to improve performance. Finally, we also determine the complexity of the plan compliance problem, that is, finding a plan that leads from an initial state to a desired goal state without reaching any undesired critical state. We consider all actions to be balanced, that is, their pre and post-conditions have the same number of facts. Under this assumption on actions, we show that the plan compliance problem is PSPACE-complete when all actions have only deterministic effects and is EXPTIME-complete when actions may have non-deterministic effects.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Računarstvo

Napomena
Rad je kao predavanje prezentiran i na skupu 5th Croatian Mathematical Congress, održanom od 18-21.6.2012.g., Rijeka, Hrvatska.

POVEZANOST RADA