A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Symmetry reductions for a class of discrete-event systems
2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
Issues related to the control and verification of isomorphic modular discrete-event systems are investigated. A finite state automaton system model is considered for the system modules where a set of atomic propositions are defined on the states. A type of symmetry is defined for these modular systems and a restriction of the µ-calculus designed for these systems is introduced. A procedure is shown to reduce the cost in computation time and memory for testing if symmetric modular systemsdoi:10.1109/cdc.2004.1428603 fatcat:fu2duy733rdxtjyphxqaoq6ote