Compliance in Real Time Multiset Rewriting Models

11/12/2018
by   Max Kanovich, et al.
0

The notion of compliance in Multiset Rewriting Models (MSR) has been introduced for untimed models and for models with discrete time. In this paper we revisit the notion of compliance and adapt it to fit with additional nondeterminism specific for dense time domains. Existing MSR with dense time are extended with critical configurations and non-critical traces, that is, traces involving no critical configurations. Complexity of related non-critical reachability problem is investigated. Although this problem is undecidable in general, we prove that for balanced MSR with dense time the non-critical reachability problem is PSPACE-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2020

Reachability is Tower Complete

A complete characterization of the complexity of the reachability proble...
research
03/09/2019

Analyzing the Impact of GDPR on Storage Systems

The recently introduced General Data Protection Regulation (GDPR) is for...
research
06/23/2018

A Note on Digitization of Real-Time Models and Logics

Digitization provides a sound and complete method to reduce the problem ...
research
05/12/2021

Proving Regulatory Compliance: A Computational Complexity Analysis of Elementary Variants

Organisations model their processes using so-called business process mod...
research
05/08/2019

On recoverability of finite traces of square-summable sequences

The paper investigates recoverability of infinite sequences (discrete ti...
research
12/10/2021

Critical configurations for three projective views

The problem of structure from motion is concerned with recovering the 3-...

Please sign up or login with your details

Forgot password? Click here to reset