Abstract We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, PSpace -complete problem. Our approach, like others before, leverage notion of quasiorder prune search for counterexample by discarding candidates which are subsumed quasiorder. Discarded guaranteed not compromise completeness algorithm. The novelty our work lies in used discard can...

uml is known as one of the most common methods in software engineering.since this language is semi-formal, many researches and efforts have beenperformed to transform this language into formal methods including petri nets.thus, the operation of verification and validation of the qualitative and nonfunctionalparameters could be achieved with more ability. since the majority of thereal world info...

in recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. in the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. in this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (oopls) us...