Synchronous composition of finite interval automata

In this work, we study the class of real-time discrete-event systems modeled by finite interval automata, i.e., a finite state automaton where each transition is labeled by an event and an interval. The class of finite interval automata is interpreted over discrete time models and corresponds exactl...

Full description

Saved in:
Bibliographic Details
Main Authors: Lin, Liyong, Su, Rong, Brandin, Bertil A., Ware, Simon, Zhu, Yuting, Sun, Yajuan
Other Authors: School of Electrical and Electronic Engineering
Format: Conference or Workshop Item
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/137885
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-137885
record_format dspace
spelling sg-ntu-dr.10356-1378852020-04-28T08:25:52Z Synchronous composition of finite interval automata Lin, Liyong Su, Rong Brandin, Bertil A. Ware, Simon Zhu, Yuting Sun, Yajuan School of Electrical and Electronic Engineering 2019 IEEE 15th International Conference on Control and Automation Engineering::Electrical and electronic engineering Timed Discrete-event Systems Interval Automata In this work, we study the class of real-time discrete-event systems modeled by finite interval automata, i.e., a finite state automaton where each transition is labeled by an event and an interval. The class of finite interval automata is interpreted over discrete time models and corresponds exactly to the class of finite tick automata. An interval domain construction of the synchronous product of finite interval automata is provided that exactly encodes the synchronous product in the tick domain. This avoids explicit enumeration of clock ticks that is required by the timed discrete-event systems and finite tick automata formalism. To increase the expressive power of the finite interval automata, we also distinguish preempting transitions from non-preempting transitions. As a result, each timed discrete-event system can be encoded using a finite interval automaton. NRF (Natl Research Foundation, S’pore) Accepted version 2020-04-17T04:04:08Z 2020-04-17T04:04:08Z 2019 Conference Paper Lin, L., Su, R., Brandin, B. A., Ware, S., Zhu, Y., & Sun, Y. (2019). Synchronous composition of finite interval automata. Proceedings of 2019 IEEE 15th International Conference on Control and Automation (ICCA), 578-583. doi:10.1109/ICCA.2019.8899529 9781728111650 https://hdl.handle.net/10356/137885 578 583 en © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/ICCA.2019.8899529 application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Timed Discrete-event Systems
Interval Automata
spellingShingle Engineering::Electrical and electronic engineering
Timed Discrete-event Systems
Interval Automata
Lin, Liyong
Su, Rong
Brandin, Bertil A.
Ware, Simon
Zhu, Yuting
Sun, Yajuan
Synchronous composition of finite interval automata
description In this work, we study the class of real-time discrete-event systems modeled by finite interval automata, i.e., a finite state automaton where each transition is labeled by an event and an interval. The class of finite interval automata is interpreted over discrete time models and corresponds exactly to the class of finite tick automata. An interval domain construction of the synchronous product of finite interval automata is provided that exactly encodes the synchronous product in the tick domain. This avoids explicit enumeration of clock ticks that is required by the timed discrete-event systems and finite tick automata formalism. To increase the expressive power of the finite interval automata, we also distinguish preempting transitions from non-preempting transitions. As a result, each timed discrete-event system can be encoded using a finite interval automaton.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Lin, Liyong
Su, Rong
Brandin, Bertil A.
Ware, Simon
Zhu, Yuting
Sun, Yajuan
format Conference or Workshop Item
author Lin, Liyong
Su, Rong
Brandin, Bertil A.
Ware, Simon
Zhu, Yuting
Sun, Yajuan
author_sort Lin, Liyong
title Synchronous composition of finite interval automata
title_short Synchronous composition of finite interval automata
title_full Synchronous composition of finite interval automata
title_fullStr Synchronous composition of finite interval automata
title_full_unstemmed Synchronous composition of finite interval automata
title_sort synchronous composition of finite interval automata
publishDate 2020
url https://hdl.handle.net/10356/137885
_version_ 1681058047535874048