Abstract
A large number of models that are employed in the field of concurrent systems design, such as Petri Nets, gate-level circuits, Static Data Flow Structures and Conditional Partial Order Graphs have an underlying static graph structure. Their semantics, however, is defined using additional entities, e.g. tokens or node/arc states, which in turn form the overall state of the system. We jointly refer to such formalisms as Interpreted Graph Models. The similarities in notation allow for links between different models to be created, such as interfaces between different formalisms or conversion from one model type into another, which greatly extend the range of applicable analysis techniques.
This paper presents the new version of the Workcraft tool designed to provide a flexible common framework for development of Interpreted Graph Models, including visual editing, (co-)simulation and analysis. The latter can be carried out either directly or by mapping a model into a behaviourally equivalent model of a different type (usually a Petri Net). Hence the user can design a system using the most appropriate formalism (or even different formalisms for the subsystems), while still utilising the power of Petri Net analysis techniques. The tool is platform-independent, highly customisable by means of plug-ins, and is freely available for academic use.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ampalam, M., Singh, M.: Counterflow pipelining: architectural support for preemption in asynchronous systems using anti-tokens. In: Proc. CAD 2006 (2006)
Bardsley, A., Edwards, D.: The Balsa asynchronous circuit synthesis system. In: Forum on Design Languages (2000)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers. IEICE Trans. Inf. and Syst. E80-D(3), 315–325 (1997)
Golubcovs, S., Mokhov, A., Yakovlev, A.: Multi-resource Arbiter Design. In: Proc. 20th UK Asynchronous Forum (2008)
Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD thesis, School of Computing Science, Newcastle University (2003)
Khomenko, V., Koutny, M., Yakovlev, A.: Detecting state encoding conflicts in STG unfoldings using SAT. Fundam. Inf. 62(2), 221–241 (2004)
Kishinevsky, M.A., Kondratyev, A.Y., Taubin, A.R., Varshavsky, V.I.: On self-timed behavior verification. In: ACM Intl. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (1992)
Mokhov, A., Yakovlev, A.: Conditional Partial Order Graphs and Dynamically Reconfigurable Control Synthesis. In: Proc. DATE 2008 (2008)
Pep homepage, http://theoretica.informatik.uni-oldenburg.de/~pep/
Poliakov, I., Mokhov, A., Rafiev, A., Sokolov, D., Yakovlev, A.: Automated verification of asynchronous circuits using circuit Petri nets. In: Proc. ASYNC 2008, pp. 161–170. IEEE Computer Society, Los Alamitos (2008)
Poliakov, I., Sokolov, D., Mokhov, A.: Workcraft: a static data flow structure editing, visualisation and analysis tool. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 505–514. Springer, Heidelberg (2007)
Roig, O.: Formal Verification and Testing of Asynchronous Circuits. PhD thesis, Universitat Politecnica de Catalunya (1997)
Sokolov, D., Poliakov, I., Yakovlev, A.: Asynchronous data path models. In: Proc. ACSD 2007 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poliakov, I., Khomenko, V., Yakovlev, A. (2009). Workcraft – A Framework for Interpreted Graph Models. In: Franceschinis, G., Wolf, K. (eds) Applications and Theory of Petri Nets. PETRI NETS 2009. Lecture Notes in Computer Science, vol 5606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02424-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-02424-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02423-8
Online ISBN: 978-3-642-02424-5
eBook Packages: Computer ScienceComputer Science (R0)