Modeling data-intensive reactive systems with relational transition systems

Alexander Tuzhilin, Zvi M. Kedem

Research output: Contribution to journalArticle

Abstract

In this paper, the formalism of Relational Transition Systems (RTSes) is used to model data-intensive reactive systems, and four RTS models of reactive systems based on temporal logic programming, production systems, recurrence equations, and Petri nets are presented. The paper also describes different methods of comparison of the expressive powers of various RTSes in terms of the trajectories they can generate and carries out this comparison for the four RTS formalisms It is shown that these formalisms have the same expressive power in the deterministic case. The paper also compares expressive powers of non-deterministic production systems and non-deterministic temporal logic programming systems. It is shown that, although the two formalisms are incomparable in the general case, their restricted versions are isomorphic to each other.

Original languageEnglish (US)
Pages (from-to)203-231
Number of pages29
JournalActa Informatica
Volume33
Issue number3
DOIs
StatePublished - May 1996

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Networks and Communications

Cite this