/*
 *  Eindhoven University of Technology
 *  Eindhoven, The Netherlands
 *
 *  Name            :   sadf_collection.h
 *
 *  Author          :   Bart Theelen (B.D.Theelen@tue.nl)
 *
 *  Date            :   29 August 2006
 *
 *  Function        :   Transformation of strongly consistent SADF Graphs with at most one Dectector and fixed execution times per scenario into collection of SDF Graphs
 *
 *  History         :
 *      29-08-06    :   Initial version.
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the
 * Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 *
 * In other words, you are welcome to use, share and improve this program.
 * You are forbidden to forbid anyone else to use, share and improve
 * what you give them.   Happy coding!
 */

#ifndef SADF_COLLECTION_H_INCLUDED
#define SADF_COLLECTION_H_INCLUDED

// Include type definitions

#include "sadf_fix_scenario.h"
#include "../../verification/moc/sadf_moc.h"
#include "../sdf/sadf2sdf.h"

// Verifies whether a strongly consistent SADF Graph has at most one Detector and fixed execution times and if so, it returns a collection of SDF Graphs (one for each scenario)
bool SADF_Verify_SimpleStronglyConsistentSDFCollection(SADF_Graph *Graph, list<SDFgraph *> &Collection);

#endif
