A Labeled Transition Model A-LTS for History-Based Aspect Weaving and Its Expressive Power

Isao YAGI; Yoshiaki TAKATA; Hiroyuki SEKI

doi:10.1093/ietisy/e90-d.5.799

A Labeled Transition Model A-LTS for History-Based Aspect Weaving and Its Expressive Power

Isao YAGI, Yoshiaki TAKATA, Hiroyuki SEKI

Full Text Views

0

Share
Cite this

Summary :

This paper proposes an event-based transition system called A-LTS. An A-LTS is a simple system consisting of two agents, a basic program and a monitor. The monitor observes the behavior of the basic program and if the behavior matches some pre-defined pattern, then the monitor interrupts the execution of the basic program and possibly triggers the execution of another specific program. An A-LTS models a common feature found in recent software technologies such as Aspect-Oriented Programming (AOP), history-based access control and active database. We investigate the expressive power of A-LTS and show that it is strictly stronger than finite state machines and strictly weaker than pushdown automata (PDA). This implies that the model checking problem for A-LTS is decidable. It is also shown that the expressive power of A-LTS, linear context-free grammar and deterministic PDA are mutually incomparable. We also discuss the relationship between A-LTS and pointcut/advice in AOP.

Publication: IEICE TRANSACTIONS on Information Vol.E90-D No.5 pp.799-807

Publication Date: 2007/05/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1093/ietisy/e90-d.5.799

Type of Manuscript: PAPER

Category: Automata and Formal Language Theory

Cite this

Copy

Isao YAGI, Yoshiaki TAKATA, Hiroyuki SEKI, "A Labeled Transition Model A-LTS for History-Based Aspect Weaving and Its Expressive Power" in IEICE TRANSACTIONS on Information, vol. E90-D, no. 5, pp. 799-807, May 2007, doi: 10.1093/ietisy/e90-d.5.799.
Abstract: This paper proposes an event-based transition system called A-LTS. An A-LTS is a simple system consisting of two agents, a basic program and a monitor. The monitor observes the behavior of the basic program and if the behavior matches some pre-defined pattern, then the monitor interrupts the execution of the basic program and possibly triggers the execution of another specific program. An A-LTS models a common feature found in recent software technologies such as Aspect-Oriented Programming (AOP), history-based access control and active database. We investigate the expressive power of A-LTS and show that it is strictly stronger than finite state machines and strictly weaker than pushdown automata (PDA). This implies that the model checking problem for A-LTS is decidable. It is also shown that the expressive power of A-LTS, linear context-free grammar and deterministic PDA are mutually incomparable. We also discuss the relationship between A-LTS and pointcut/advice in AOP.
URL: https://globals.ieice.org/en_transactions/information/10.1093/ietisy/e90-d.5.799/_p

Copy

@ARTICLE{e90-d_5_799,
author={Isao YAGI, Yoshiaki TAKATA, Hiroyuki SEKI, },
journal={IEICE TRANSACTIONS on Information},
title={A Labeled Transition Model A-LTS for History-Based Aspect Weaving and Its Expressive Power},
year={2007},
volume={E90-D},
number={5},
pages={799-807},
abstract={This paper proposes an event-based transition system called A-LTS. An A-LTS is a simple system consisting of two agents, a basic program and a monitor. The monitor observes the behavior of the basic program and if the behavior matches some pre-defined pattern, then the monitor interrupts the execution of the basic program and possibly triggers the execution of another specific program. An A-LTS models a common feature found in recent software technologies such as Aspect-Oriented Programming (AOP), history-based access control and active database. We investigate the expressive power of A-LTS and show that it is strictly stronger than finite state machines and strictly weaker than pushdown automata (PDA). This implies that the model checking problem for A-LTS is decidable. It is also shown that the expressive power of A-LTS, linear context-free grammar and deterministic PDA are mutually incomparable. We also discuss the relationship between A-LTS and pointcut/advice in AOP.},
keywords={},
doi={10.1093/ietisy/e90-d.5.799},
ISSN={1745-1361},
month={May},}

Copy

TY - JOUR
TI - A Labeled Transition Model A-LTS for History-Based Aspect Weaving and Its Expressive Power
T2 - IEICE TRANSACTIONS on Information
SP - 799
EP - 807
AU - Isao YAGI
AU - Yoshiaki TAKATA
AU - Hiroyuki SEKI
PY - 2007
DO - 10.1093/ietisy/e90-d.5.799
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E90-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2007
AB - This paper proposes an event-based transition system called A-LTS. An A-LTS is a simple system consisting of two agents, a basic program and a monitor. The monitor observes the behavior of the basic program and if the behavior matches some pre-defined pattern, then the monitor interrupts the execution of the basic program and possibly triggers the execution of another specific program. An A-LTS models a common feature found in recent software technologies such as Aspect-Oriented Programming (AOP), history-based access control and active database. We investigate the expressive power of A-LTS and show that it is strictly stronger than finite state machines and strictly weaker than pushdown automata (PDA). This implies that the model checking problem for A-LTS is decidable. It is also shown that the expressive power of A-LTS, linear context-free grammar and deterministic PDA are mutually incomparable. We also discuss the relationship between A-LTS and pointcut/advice in AOP.
ER -