Minimizing the Number of Transitions with Respect to Observation Equivalence

@article{Eloranta1991MinimizingTN,
  title={Minimizing the Number of Transitions with Respect to Observation Equivalence},
  author={Jaana Eloranta},
  journal={BIT},
  year={1991},
  volume={31},
  pages={576-590}
}
Labeled transition systems (lts) provide an operational semantics for many speciication languages. In order to abstract unrelevant details of lts's, many behavioural equivalences have been deened; here observation equivalence is considered. We are interested in the following problem: Given a nite lts, which is the minimal observation equivalent lts corresponding to it ? It is well known that the number of states of an lts can be minimized by applying an rela-tional coarsest partition algorithm… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS