CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Symbolic Interpretation and Execution of Extended Finite Automata

Mohammad Reza Shoaei (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, Automation)
12th IFAC/ IEEE International Workshop on Discrete Event Systems (WODES) (1474-6670). Vol. 12 (2014), p. 228-234.
[Konferensbidrag, refereegranskat]

We introduce a symbolic interpretation and execution technique for Extended Finite Automata (EFAs) and provide an interpreter that symbolically interprets and executes EFAs w.r.t. their (internal) variables. More specifically, the interpreter iterates over the EFA transitions, and by passing each transition, it symbolically interprets and evaluates the condition on the transition w.r.t. the known values of variables, and leaves other variables intact, and when it terminates, it returns the residual model. It is shown that the behavior of the residual system with respect to the original system is left unchanged. Finally, we demonstrate the effectiveness and necessity of the symbolic interpretation and execution combined with abstractions for the nonblocking supervisory control of two manufacturing systems.

Nyckelord: Discrete-event systems, symbolic interpretation, supervisory control theory



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-12-16. Senast ändrad 2016-01-18.
CPL Pubid: 189370

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)