FROM DIOID ALGEBRA TO P-TIME EVENT GRAPHS

Mohamed Khalid DIDI ALAOUI, Philippe DECLERCK

2004

Abstract

The (max,+) algebra is usually used to model Timed event graph. In this paper, we show that P-time event graphs which extend Timed event graph, can be modelled using maximum, minimum and addition operations. The result is a new model called interval descriptor system where the time evolution is not strictly deterministic but belongs to intervals. The cycle-time vector allows us to to check its correct behaviour and to verify the existence of a state trajectory. Particularly, it detects the presence of token-deads which can generate a deadlock.

Paper Citation

in Harvard Style

Khalid DIDI ALAOUI M. and DECLERCK P. (2004). FROM DIOID ALGEBRA TO P-TIME EVENT GRAPHS . In Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO, ISBN 972-8865-12-0, pages 332-337. DOI: 10.5220/0001137403320337

in Bibtex Style

@conference{icinco04,
author={Mohamed Khalid DIDI ALAOUI and Philippe DECLERCK},
title={FROM DIOID ALGEBRA TO P-TIME EVENT GRAPHS},
booktitle={Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,},
year={2004},
pages={332-337},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001137403320337},
isbn={972-8865-12-0},
}

in EndNote Style

TY - CONF
JO - Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,
TI - FROM DIOID ALGEBRA TO P-TIME EVENT GRAPHS
SN - 972-8865-12-0
AU - Khalid DIDI ALAOUI M.
AU - DECLERCK P.
PY - 2004
SP - 332
EP - 337
DO - 10.5220/0001137403320337