Towards the removal of synchronous behavior of events in automata

L. Swartjes; D.A. Van Beek; M.A. Reniers

doi:10.3182/20140514-3-FR-4046.00089

Towards the removal of synchronous behavior of events in automata

L. Swartjes, D.A. Van Beek, M.A. Reniers

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

9 Citations (Scopus)

Abstract

In this paper an algorithm is proposed which removes the synchronous behavior of events in automata. This is done such that a modular implementation is possible in any sequential programming language. The goal is to find automata which resemble the original automata, but do not contain synchronizing events. Moreover, these new automata, when put in parallel, must behave the same as the original system. The algorithm imposes three steps to end up with a transformed automata network. The final result yields automata which have exactly one edge for each event and each event is unique to a certain automaton. The placement of events in the final result is based on a partitioning of events. To shown applicability of the algorithm, it has been applied to a large industrial-sized system. For this system a controller is made, based on the automata model of the requirements and specifications.

Original language	English
Title of host publication	12th IFAC/IEEE Workshop on Discrete Event Systems, WODES 2104
Pages	188-194
Number of pages	7
DOIs	https://doi.org/10.3182/20140514-3-FR-4046.00089
Publication status	Published - 2014
Event	12th International Workshop on Discrete Event Systems (WODES 2014) - Cachan, France Duration: 14 May 2014 → 16 May 2014 Conference number: 12 http://wodes2014.lurpa.ens-cachan.fr/

Publication series

Name	IFAC Proceedings Volumes
Publisher	Elsevier
Number	2
Volume	47
ISSN (Print)	1474-6670

Workshop

Workshop	12th International Workshop on Discrete Event Systems (WODES 2014)
Abbreviated title	WODES 2014
Country/Territory	France
City	Cachan
Period	14/05/14 → 16/05/14
Internet address	http://wodes2014.lurpa.ens-cachan.fr/

Keywords

Algorithm
Code generation
Hybrid automata
Normalization
Synchronization

Access to Document

10.3182/20140514-3-FR-4046.00089

Cite this

@inproceedings{9dd0ce6dfbd149b0aca6a64a5cb3f306,

title = "Towards the removal of synchronous behavior of events in automata",

abstract = "In this paper an algorithm is proposed which removes the synchronous behavior of events in automata. This is done such that a modular implementation is possible in any sequential programming language. The goal is to find automata which resemble the original automata, but do not contain synchronizing events. Moreover, these new automata, when put in parallel, must behave the same as the original system. The algorithm imposes three steps to end up with a transformed automata network. The final result yields automata which have exactly one edge for each event and each event is unique to a certain automaton. The placement of events in the final result is based on a partitioning of events. To shown applicability of the algorithm, it has been applied to a large industrial-sized system. For this system a controller is made, based on the automata model of the requirements and specifications.",

keywords = "Algorithm, Code generation, Hybrid automata, Normalization, Synchronization",

author = "L. Swartjes and {Van Beek}, D.A. and M.A. Reniers",

year = "2014",

doi = "10.3182/20140514-3-FR-4046.00089",

language = "English",

series = "IFAC Proceedings Volumes",

publisher = "Elsevier",

number = "2",

pages = "188--194",

booktitle = "12th IFAC/IEEE Workshop on Discrete Event Systems, WODES 2104",

note = "12th International Workshop on Discrete Event Systems (WODES 2014), WODES 2014 ; Conference date: 14-05-2014 Through 16-05-2014",

url = "http://wodes2014.lurpa.ens-cachan.fr/",

}

Swartjes, L, Van Beek, DA & Reniers, MA 2014, Towards the removal of synchronous behavior of events in automata. in 12th IFAC/IEEE Workshop on Discrete Event Systems, WODES 2104. IFAC Proceedings Volumes, no. 2, vol. 47, pp. 188-194, 12th International Workshop on Discrete Event Systems (WODES 2014), Cachan, France, 14/05/14. https://doi.org/10.3182/20140514-3-FR-4046.00089

TY - GEN

T1 - Towards the removal of synchronous behavior of events in automata

AU - Swartjes, L.

AU - Van Beek, D.A.

AU - Reniers, M.A.

N1 - Conference code: 12

PY - 2014

Y1 - 2014

N2 - In this paper an algorithm is proposed which removes the synchronous behavior of events in automata. This is done such that a modular implementation is possible in any sequential programming language. The goal is to find automata which resemble the original automata, but do not contain synchronizing events. Moreover, these new automata, when put in parallel, must behave the same as the original system. The algorithm imposes three steps to end up with a transformed automata network. The final result yields automata which have exactly one edge for each event and each event is unique to a certain automaton. The placement of events in the final result is based on a partitioning of events. To shown applicability of the algorithm, it has been applied to a large industrial-sized system. For this system a controller is made, based on the automata model of the requirements and specifications.

AB - In this paper an algorithm is proposed which removes the synchronous behavior of events in automata. This is done such that a modular implementation is possible in any sequential programming language. The goal is to find automata which resemble the original automata, but do not contain synchronizing events. Moreover, these new automata, when put in parallel, must behave the same as the original system. The algorithm imposes three steps to end up with a transformed automata network. The final result yields automata which have exactly one edge for each event and each event is unique to a certain automaton. The placement of events in the final result is based on a partitioning of events. To shown applicability of the algorithm, it has been applied to a large industrial-sized system. For this system a controller is made, based on the automata model of the requirements and specifications.

KW - Algorithm

KW - Code generation

KW - Hybrid automata

KW - Normalization

KW - Synchronization

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

U2 - 10.3182/20140514-3-FR-4046.00089

DO - 10.3182/20140514-3-FR-4046.00089

M3 - Conference contribution

AN - SCOPUS:84945956484

T3 - IFAC Proceedings Volumes

SP - 188

EP - 194

BT - 12th IFAC/IEEE Workshop on Discrete Event Systems, WODES 2104

T2 - 12th International Workshop on Discrete Event Systems (WODES 2014)

Y2 - 14 May 2014 through 16 May 2014

ER -

Towards the removal of synchronous behavior of events in automata

Abstract

Publication series

Workshop

Keywords

Access to Document

Other files and links

Fingerprint

Cite this