crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 617917

Zbornik radova

Autori: Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre; Talcott, Carolyn; Perovic, Ranko
Naslov: A Rewriting Framework for Activities Subject to Regulations
Izvornik: 23rd International Conference on Rewriting Techniques and Applications (RTA'12) : proceedings / Ashish Tiwari (ur.). - Dagstuhl - 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-02.06.2012.
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.
Vrsta sudjelovanja: Predavanje
Vrsta prezentacije u zborniku: Cjeloviti rad (više od 1500 riječi)
Vrsta recenzije: Međunarodna recenzija
Izvorni jezik: ENG
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Arhitektura i urbanizam,Brodogradnja
Puni text rada: 617917.rta2012_submission_151.pdf (tekst priložen 11. Vel. 2013. u 17:50 sati)
URL Internet adrese: http://drops.dagstuhl.de/opus/volltexte/2012/3500/
Upisao u CROSBI: Tajana Ban Kirigin (bank@math.uniri.hr), 11. Vel. 2013. u 17:48 sati
Napomene:
Rad je kao predavanje prezentiran i na skupu 5th Croatian Mathematical Congress, održanom od 18-21.6.2012.g., Rijeka, Hrvatska.



  Verzija za printanje   za tiskati


upomoc
foot_4