Generalised projections in finite state automata and decidability of state determinacy
نویسندگان
چکیده
Loss of sensors and communication links may lead to incomplete observation at the supervisory level of discrete event systems (DES). Under these circumstances, an event may conceivably be observable at one state and unobservable at another state and the observability may become dependent on the history of event occurrences. This paper presents a framework for analysis of generalised projection maps in DES, including the maps that introduce possibly unbounded memory
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملA Survey of Multi-Tape Automata
This paper summarizes the fundamental expressiveness, closure, and decidability properties of various finite-state automata classes with multiple input tapes. It also includes an original algorithm for the intersection of one-way nondeterministic finite-state automata.
متن کاملA Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours
Process calculi for service-oriented computing often feature generation of fresh resources. So-called nominal automata have been studied both as semantic models for such calculi, and as acceptors of languages of finite words over infinite alphabets. In this paper we investigate nominal automata that accept infinite words. These automata are a generalisation of deterministic Muller automata to t...
متن کاملA Process-Algebraic Semantics for Generalised Nonblocking
Generalised nonblocking is a weak liveness property to express the ability of a system to terminate under given preconditions. This paper studies the notions of equivalence and refinement that preserve generalised nonblocking and proposes a semantic model that characterises generalised nonblocking equivalence. The model can be constructed from the transition structure of an automaton, and has a...
متن کاملProgress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata
Using the concept of progress measure, we give a new proof of Rabin’s fundamental result that the languages defined by tree automata are closed under complementation. To do this we show that for certain infinite games based on tree automata, an immediate determinacy property holds for the player who is trying to win according to a Rabin acceptance condition. Immediate determinancy is stronger t...
متن کامل