Share Email Print
cover

Proceedings Paper

A method of transition conflict resolving in hierarchical control
Author(s): Grzegorz Łabiak
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The paper concerns the problem of automatic solving of transition conflicts in hierarchical concurrent state machines (also known as UML state machine). Preparing by the designer a formal specification of a behaviour free from conflicts can be very complex. In this paper, it is proposed a method for solving conflicts through transition predicates modification. Partially specified predicates in the nondeterministic diagram are transformed into a symbolic Boolean space, whose points of the space code all possible valuations of transition predicates. Next, all valuations under partial specifications are logically multiplied by a function which represents all possible orthogonal predicate valuations. The result of this operation contains all possible collections of predicates, which under given partial specification make that the original diagram is conflict free and deterministic.

Paper Details

Date Published: 28 September 2016
PDF: 9 pages
Proc. SPIE 10031, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2016, 100314J (28 September 2016); doi: 10.1117/12.2249046
Show Author Affiliations
Grzegorz Łabiak, Univ. of Zielona Góra (Poland)


Published in SPIE Proceedings Vol. 10031:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2016
Ryszard S. Romaniuk, Editor(s)

© SPIE. Terms of Use
Back to Top