A Rewriting Framework and Logic for Activities Subject to Regulations

Abstract

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, 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 28, 2015
Accession Number
ADA626172

Entities

People

  • Andre Scedrov
  • Carolyn Talcott
  • Max Kanovich
  • Ranko Perovic
  • Tajana B. Kirigin
  • Vivek Nigam

Organizations

  • University of Pennsylvania

Tags

Communities of Interest

  • Biomedical
  • Cyber

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Automata
  • Clocks
  • Computational Complexity
  • Computer Languages
  • Computer Science
  • Computers
  • Cybersecurity
  • Electronic Mail
  • Health Care
  • Language
  • Machines
  • Numbers
  • Regulations
  • Security Protocols
  • Theoretical Computer Science

Readers

  • Government and Public Administration Law.
  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design