Automata.java

/* Copyright or (C) or Copr. GET / ENST, Telecom-Paris, Ludovic Apvrille
 * 
 * ludovic.apvrille AT enst.fr
 * 
 * This software is a computer program whose purpose is to allow the
 * edition of TURTLE analysis, design and deployment diagrams, to
 * allow the generation of RT-LOTOS or Java code from this diagram,
 * and at last to allow the analysis of formal validation traces
 * obtained from external tools, e.g. RTL from LAAS-CNRS and CADP
 * from INRIA Rhone-Alpes.
 * 
 * This software is governed by the CeCILL  license under French law and
 * abiding by the rules of distribution of free software.  You can  use,
 * modify and/ or redistribute the software under the terms of the CeCILL
 * license as circulated by CEA, CNRS and INRIA at the following URL
 * "http://www.cecill.info".
 * 
 * As a counterpart to the access to the source code and  rights to copy,
 * modify and redistribute granted by the license, users are provided only
 * with a limited warranty  and the software's author,  the holder of the
 * economic rights,  and the successive licensors  have only  limited
 * liability.
 * 
 * In this respect, the user's attention is drawn to the risks associated
 * with loading,  using,  modifying and/or developing or reproducing the
 * software by the user in light of its specific status of free software,
 * that may mean  that it is complicated to manipulate,  and  that  also
 * therefore means  that it is reserved for developers  and  experienced
 * professionals having in-depth computer knowledge. Users are therefore
 * encouraged to load and test the software's suitability as regards their
 * requirements in conditions enabling the security of their systems and/or
 * data to be ensured and,  more generally, to use and operate it in the
 * same conditions as regards security.
 * 
 * The fact that you are presently reading this means that you have had
 * knowledge of the CeCILL license and that you accept its terms.
 */




package automata;

import java.util.LinkedList;
import java.util.ListIterator;


/**
 * Class Automata
 * Creation: 23/03/2006
 * @version 1.0 23/03/2006
 * @author Ludovic APVRILLE
 */
public class Automata {
    private State initState;
    private LinkedList<State> states;
    private String name;
 
    public Automata() {
         states = new LinkedList<State>();
         initState = new State("0");
         states.add(initState);
    }
    
    public Automata(String init) {
         states = new LinkedList<State>();
         initState = new State(init);
         states.add(initState);
    }
    
    public void setName(String _name) {
        name = _name;
    }
    
    public String getName() {
        return name;
    }
    
    public State getInitState() {
        return initState;
    }
    
    public State getState(int index) {
        return states.get(index);
    }
    
    public void addState(State s) {
        states.add(s);
    }
    
    public State newState() {
        State s = new State("" + nbOfStates());
        addState(s);
        return s;
    }
    
    public int nbOfStates() {
        return states.size();
    }
    
    public LinkedList<State> getStates() {
        return states;
    }
    
    public int nbOfTransitions() {
        int nb = 0;
        ListIterator<State> iterator = states.listIterator();
        while(iterator.hasNext()) {
            nb+= iterator.next().nbOfTransitions();
        }
        return nb;
    }
    
    public String toAUT() {
        StringBuffer sb = new StringBuffer();
        sb.append("des(" + initState.getName() + "," + nbOfTransitions() + "," + nbOfStates() + ")\n");
        ListIterator<State> iterator = states.listIterator();
        while(iterator.hasNext()) {
            sb.append(iterator.next().toAUT());
        }
        return new String(sb);
    }
    
    public void renameStates() {
        State s;
        int cpt = 0;
        ListIterator<State> iterator = states.listIterator();
        while(iterator.hasNext()) {
            s = iterator.next();
            s.setName(""+cpt);
            cpt ++;
        }
    }
    
 
}