Abstract
The paper presents a way how the network diagram representation of a project plan is transformed to a corresponding timed coloured Petri net (T-CPN) working over discrete time. Such a T-CPN model is further equipped with resource modelling and mutually exclusive activity performance modelling. The paper demonstrates an algorithm, how the key main network diagram representations of a project plan are translated to a T-CPN and how the resource modelling is (possibly algorithmically) added next.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Aided Engineering and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
