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

Compositional Nonblocking Verification for Extended Finite-State Automata Using Partial Unfolding

Sahar Mohajerani (Institutionen för signaler och system, Automation) ; Robi Malik ; Martin Fabian (Institutionen för signaler och system, Automation)
IEEE International Conference on Automation Science and Engineering (CASE), 2013 (2161-8070). p. 930 - 935. (2013)
[Konferensbidrag, refereegranskat]

This paper describes a framework for compositional nonblocking verification of discrete event systems modelled as extended finite-state automata. Compositional verification is shown in previous work to be efficient to verify the nonblocking property of large discrete event systems. Here, these results are applied to extended finite-state automata communicating via shared variables and events. The model to be verified is composed gradually, partially unfolding variables as needed. At each step, symbolic observation equivalence is used to simplify the resultant components in such a way that the final verification result is the same as it would have been for the original model. The paper concludes with an example showing the potential of compositional verification to achieve substantial state-space reduction.

Nyckelord: Partial unfolding, Extended finite automaton, Verification



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

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-12-06. Senast ändrad 2016-02-01.
CPL Pubid: 188583

 

Läs direkt!


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