作者: Zbigniew Suraj
DOI: 10.1007/978-3-7908-1883-3_22
关键词:
摘要: We discuss the synthesis problem of concurrent systems from observations or specification encoded in data table (information system) [Pawlak,1991]. In paper we first introduce a new notion so-called dynamic information system, and then apply this as tool for behaviour [Pawlak,1992], [Pawlak,1997]. Finally, present two methods construction any system DS with its underlying S, transition TS describing DS, model form an elementary net N [Thiagarajan,1987] following property: given is isomorphic to associated constructed N. method assume that representing contains whole knowledge about observed specified system. For setting, adopt solution models suggested by [Desel Reisig,1996]. A which using concept regions systems, introduced [Ehrenfeucht Rozenberg,1990]. The second presented based on approach consists only partial behaviour. Thus, at compute extension DS′ i.e. set all global states consistent rules true S represents largest represented S. Next, finding considered here use method. This rough theory [Pawlak,1991] Boolean reasoning [Brown,1990]. have implemented program IBM PC generating