Bisimulations over DLTS in O(m.log n)-time

Abstract : The well known Hopcroft's algorithm to minimize deterministic complete automata runs in $O(kn\log n)$-time, where $k$ is the size of the alphabet and $n$ the number of states. The main part of this algorithm corresponds to the computation of a coarsest bisimulation over a finite Deterministic Labelled Transition System (DLTS). By applying techniques we have developed in the case of simulations, we design a new algorithm which computes the coarsest bisimulation over a finite DLTS in $O(m\log n)$-time and $O(k+m+n)$-space, with $m$ the number of transitions. The underlying DLTS does not need to be complete and thus: $m\leq kn$. This new algorithm is much simpler than the two others found in the literature.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00788402
Contributor : Gérard Cece <>
Submitted on : Thursday, February 14, 2013 - 1:31:04 PM
Last modification on : Friday, July 6, 2018 - 3:06:08 PM
Document(s) archivé(s) le : Wednesday, May 15, 2013 - 3:58:19 AM

Files

bisimDLTS_hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00788402, version 1
  • ARXIV : 1302.3489

Citation

Gérard Cece. Bisimulations over DLTS in O(m.log n)-time. 2013. ⟨hal-00788402⟩

Share

Metrics

Record views

146

Files downloads

65