Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

A Rewriting Framework for Activities Subject to Regulations (CROSBI ID 594530)

Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija

Kanovich, Max ; Ban Kirigin, Tajana ; Nigam, Vivek ; Scedrov, Andre ; Talcott, Carolyn ; Perović, Ranko A Rewriting Framework for Activities Subject to Regulations // 23rd International Conference on Rewriting Techniques and Applications (RTA'12) : proceedings / Ashish Tiwari (ur.). Wadern : Leibniz: Zentrum fuer Informatik, 2012. str. 305-322 doi: 10.4230/LIPIcs.RTA.2012.305

Podaci o odgovornosti

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

engleski

A Rewriting Framework for Activities Subject to Regulations

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.

Multiset Rewrite Systems ; Collaborative Systems ; Applications of Rewrite Systems ; Clinical Investigations ; Maude

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

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

305-322.

2012.

objavljeno

10.4230/LIPIcs.RTA.2012.305

Podaci o matičnoj publikaciji

23rd International Conference on Rewriting Techniques and Applications (RTA'12) : proceedings

Ashish Tiwari

Wadern : Leibniz: Zentrum fuer Informatik

978-3-939897-38-5

Podaci o skupu

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

predavanje

28.05.2012-02.06.2012

Nagoya, Japan

Povezanost rada

Matematika, Računarstvo

Poveznice