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
StatePublished - May 1996

Fingerprint

Temporal logic
Logic programming
Data structures
Petri nets
Trajectories

ASJC Scopus subject areas

  • Information Systems

Cite this

Modeling data-intensive reactive systems with relational transition systems. / Tuzhilin, Alexander; Kedem, Zvi M.

In: Acta Informatica, Vol. 33, No. 3, 05.1996, p. 203-231.

Research output: Contribution to journalArticle

@article{23accb61240743c882e200d77af862d7,
title = "Modeling data-intensive reactive systems with relational transition systems",
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.",
author = "Alexander Tuzhilin and Kedem, {Zvi M.}",
year = "1996",
month = "5",
language = "English (US)",
volume = "33",
pages = "203--231",
journal = "Acta Informatica",
issn = "0001-5903",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Modeling data-intensive reactive systems with relational transition systems

AU - Tuzhilin, Alexander

AU - Kedem, Zvi M.

PY - 1996/5

Y1 - 1996/5

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

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

UR - http://www.scopus.com/inward/record.url?scp=0030557890&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030557890&partnerID=8YFLogxK

M3 - Article

VL - 33

SP - 203

EP - 231

JO - Acta Informatica

JF - Acta Informatica

SN - 0001-5903

IS - 3

ER -