PriorityPetriNet.hh

Go to the documentation of this file.

#ifndef __DIADES__PETRI__PRIORITYPETRINET_HH_
#define __DIADES__PETRI__PRIORITYPETRINET_HH_

#include<unordered_map>
#include<list>

using namespace std;


namespace Diades
{
  namespace Petri
  {

        class PriorityPetriNet : virtual public Petri::Net
        {
        private:
          std::unordered_multimap<Transition,Transition> _priorities;
          
        public:
          typedef  std::unordered_multimap<Transition,Transition> Priorities;
          typedef pair<Priorities::const_iterator,Priorities::const_iterator> Range;
          
          PriorityPetriNet():Net(),_priorities(){}

          virtual ~PriorityPetriNet(){}

          void setPriority(Transition t1, Transition t2)
          {
                removePriority(t1,t2);
                _priorities.insert(make_pair(t1,t2));
          }

          void removePriority(Transition t1, Transition t2)
          {
                Range range = priorities(t1);
                bool removed = false;
                while(!removed && (range.first != range.second))
                  {
                        removed = ((range.first->second) == t2);
                        if(removed)
                          {
                                _priorities.erase(range.first);
                          }
                        else
                          {
                                ++(range.first);
                          }
                  }
          }

          Range  priorities() const
          {
                return make_pair(_priorities.begin(),_priorities.end());
          }

          
          Range priorities(Transition t) const
          {
                return  _priorities.equal_range(t);
          }
          
          bool hasPriority(Transition t1, Transition t2) const
          {
                Range range = priorities(t1);
                bool found = false;
                while(!found && (range.first != range.second))
                  {
                        found = ((range.first->second) == t2);
                        ++(range.first);
                  }
                return found;
          }


          virtual void priorities2Tina(ostream & os) const
          {
                //prdesc ::= ’pr’ (<transition>)+ ("<"|">") (<transition>)+
                Range range = priorities();
                while(range.first != range.second)
                  {
                        os << "pr ";
                        os << labelOfTransition(range.first->first)
                           << " < " << labelOfTransition(range.first->second)
                           << std::endl;
                        ++range.first;
                  }
          }
          
        };


  };
};

#endif