Skip to main content
×
×
Home

A rewriting framework and logic for activities subject to regulations

  • MAX KANOVICH (a1) (a2) (a3), TAJANA BAN KIRIGIN (a4), VIVEK NIGAM (a5), ANDRE SCEDROV (a3) (a6), CAROLYN TALCOTT (a7) and RANKO PEROVIC (a8)...
Abstract

Activities such as clinical investigations (CIs) 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, i.e. they may have different outcomes whenever applied. We present a formal semantics of our model based on focused proofs of linear logic with definitions. We also determine the computational complexity of various planning problems. Plan compliance problem, for example, is the problem of 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, i.e. 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. Finally, we show that the restrictions on the form of actions and time constraints taken in the specification of our model are necessary for decidability of the planning problems.

Copyright
References
Hide All
Alur R. and Dill D. (1994). A theory of timed automata. Theoretical Computer Science 126 183235.
Alur R. and Madhusudan P. (2004). Decision problems for timed automata: A survey. In: SFM 124.
Andreoli J.-M. (1992). Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2 (3) 297347.
Arney D., Pajic M., Goldman J. M., Lee I., Mangharam R. and Sokolsky O. (2010). Toward patient safety in closed-loop medical device systems. In (ICCPS '10), New York, NY, USA, ACM 139148.
Baelde D. (2008). A Linear Approach to the Proof-Theory of Least and Greatest Fixed Points. PhD thesis, Ecole Polytechnique.
Baelde D. and Miller D. (2007). Least and greatest fixed points in linear logic. In: Dershowitz N. and Voronkov A. (eds.) International Conference on Logic for Programming and Automated Reasoning (LPAR), volume 4790, 92106.
Barth A., Datta A., Mitchell J. C. and Nissenbaum H. (2006). Privacy and contextual integrity: Framework and applications. In: IEEE Symposium on Security and Privacy 184198.
Barth A., Mitchell J. C., Datta A. and Sundaram S. (2007). Privacy and utility in business processes. In: CSF 279294.
Chandra Kozen D. C. and Stockmeyer L. J. (1981). Alternation. Journal of the ACM 28 114133.
Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J. and Talcott C. (2007). All About Maude: A High-Performance Logical Framework, Springer.
Corin R., Etalle S., Hartel P. H. and Mader A. (2007). Timed analysis of security protocols. Journal of Computer Security 15 (6) 619645.
de Frutos Escrig D., Ruiz V. V. and Alonso O. M. (2000). Decidability of properties of timed-arc petri nets. In: ICATPN'00, Springer-Verlag 187206.
DeYoung H., Garg D., Jia L., Kaynar D. K. and Datta A. (2010). Experiences in the logical specification of the HIPAA and GLBA privacy laws. In: WPES 7382.
DeYoung H., Garg D. and Pfenning F. (2008). An authorization logic with explicit time. In: CSF 133145.
Dinesh N., Joshi A. K., Lee I. and Sokolsky O. (2008). Reasoning about conditions and exceptions to laws in regulatory conformance checking. In: DEON 110124.
Dinesh N., Joshi A. K., Lee I. and Sokolsky O. (2011). Permission to speak: A logic for access control and conformance. Journal of Logic and Algebraic Programming 5074.
Durgin N. A., Lincoln P., Mitchell J. C. and Scedrov A. (2004). Multiset rewriting and the complexity of bounded security protocols. Journal of Computer Security 12 (2) 247311.
FDA (2014). Code of Federal Regulations, Title 21, Chapter 1, Subchapter D, Part 312: Investigational New Drug Application. Available at http://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfCFR/CFRSearch.cfm?CFRPart=312&showFR=1.
Garg D., Jia L. and Datta A. (2011). Policy auditing over incomplete logs: Theory, implementation and applications. In: CCS'11. 151162.
Harrison M. A., Ruzzo W. L. and Ullman J. D. (1975). On protection in operating systems. In: SOSP'75: Proceedings of the 5th ACM Symposium on Operating Systems Principles, New York, NY, USA, ACM 1424.
Hodas J. S. and Miller D. (1994). Logic programming in a fragment of intuitionistic linear logic. Information and Computation 110 (2) 327365.
Kanovich M., Ban Kirigin T., Nigam V. and Scedrov A. (2010). Bounded memory Dolev-Yao adversaries in collaborative systems. In: FAST. 1833.
Kanovich M., Ban Kirigin T., Nigam V. and Scedrov A. (2014). Bounded memory Dolev-Yao adversaries in collaborative systems. Information and Computation 238 233261.
Kanovich M., Rowe P. and Scedrov A. (2009). Policy compliance in collaborative systems. In: CSF'09: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium, Washington, DC, USA, IEEE Computer Society.
Kanovich M. I., Ban Kirigin T., Nigam V. and Scedrov A. (2013). Bounded memory protocols and progressing collaborative systems. In: Crampton J., Jajodia S. and Mayes K. (eds.) ESORICS. Springer Lecture Notes in Computer Science, volume 8134, 309326.
Kanovich M. I., Ban Kirigin T., Nigam V. and Scedrov A. (2014). Bounded memory protocols. Computer Languages, Systems & Structures 40 (3-4) 137154.
Kanovich M. I., Ban Kirigin T., Nigam V., Scedrov A., Talcott C. L. and Perovic R. (2012). A rewriting framework for activities subject to regulations. In: Tiwari A. (ed.) RTA. LIPIcs.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 15, 305322.
Kanovich M. I., Okada M. and Scedrov A. (1998). Specifying real-time finite-state systems in linear logic. Electronic Notes in Theoretical Computer Science 16 (1) 4259.
Kanovich M. I., Rowe P. and Scedrov A. (2011). Collaborative planning with confidentiality. Journal of Automated Reasoning 46 (3–4) 389421.
Kanovich M. I. and Vauzeilles J. (2001). The classical ai planning problems in the mirror of horn linear logic: Semantics, expressibility, complexity. Mathematical Structures in Computer Science 11 (6) 689716.
Lam P. E., Mitchell J. C. and Sundaram S. (2009). A formalization of HIPAA for a medical messaging system. In: Fischer-Hübner S., Lambrinoudakis C. and Pernul G. (eds.) TrustBus. Springer Lecture Notes in Computer Science, volume 5695, 7385.
Lanotte R., Maggiolo-Schettini A. and Troina A. (2010). Reachability results for timed automata with unbounded data structures. Acta Informatica 47 (5–6) 279311.
McDowell R. and Miller D. (2000). Cut-elimination for a logic with definitions and induction. Theoretical Computer Science 232 91119.
Meseguer J. (1992). Conditional Rewriting Logic as a unified model of concurrency. Theoretical Computer Science 96 (1) 73155.
Minsky M. (1961). Recursive unsolvability of post's problem of ‘tag’ and other topics in the theory of turing machines. Annals of Mathematics. 74 (3) 437455.
Nigam V. (2012). On the complexity of linear authorization logics. In: LICS IEEE 511–520.
Nigam V., Ban Kirigin T., Scedrov A., Talcott C., Kanovich M. and Perovic R. (2012). Towards an automated assistant for clinical investigations. In: Second ACM SIGHIT International Health Informatics Symposium. 773778.
Nigam V. and Miller D. (2009). Algorithmic specifications in linear logic with subexponentials. 129140.
Nigam V. and Miller D. (2010). A framework for proof systems. Journal of Automated Reasoning 45 (2) 157188.
Ölveczky P. C. and Meseguer J. (2007). Abstraction and completeness for Real-Time Maude. Electronic Notes in Theoretical Computer Science 176 (4) 527.
Schroeder-Heister P. (1993). Rules of definitional reflection. In: Vardi M. (ed.) 8th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, IEEE 222232.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 48 *
Loading metrics...

Abstract views

Total abstract views: 266 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 19th January 2018. This data will be updated every 24 hours.