Article

Workcraft --- A Framework for Interpreted Graph Models

Authors:

Ivan Poliakov,

Victor Khomenko,

Alex YakovlevAuthors Info & Claims

PETRI NETS '09: Proceedings of the 30th International Conference on Applications and Theory of Petri Nets

Pages 333 - 342

https://doi.org/10.1007/978-3-642-02424-5_21

Published: 18 June 2009 Publication History

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 <em>Interpreted Graph Models</em> . 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 <Emphasis Type="SmallCaps">Workcraft</Emphasis> 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.

References

[1]

Ampalam, M., Singh, M.: Counterflow pipelining: architectural support for preemption in asynchronous systems using anti-tokens. In: Proc. CAD 2006 (2006).

Digital Library

Google Scholar

[2]

Bardsley, A., Edwards, D.: The Balsa asynchronous circuit synthesis system. In: Forum on Design Languages (2000).

Google Scholar

[3]

Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999).

Digital Library

Google Scholar

[4]

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).

Google Scholar

[5]

Golubcovs, S., Mokhov, A., Yakovlev, A.: Multi-resource Arbiter Design. In: Proc. 20th UK Asynchronous Forum (2008).

Google Scholar

[6]

Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD thesis, School of Computing Science, Newcastle University (2003).

Google Scholar

[7]

Khomenko, V., Koutny, M., Yakovlev, A.: Detecting state encoding conflicts in STG unfoldings using SAT. Fundam. Inf. 62(2), 221-241 (2004).

Digital Library

Google Scholar

[8]

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).

Google Scholar

[9]

Mokhov, A., Yakovlev, A.: Conditional Partial Order Graphs and Dynamically Reconfigurable Control Synthesis. In: Proc. DATE 2008 (2008).

Digital Library

Google Scholar

[10]

PEP homepage, http://theoretica.informatik.uni-oldenburg.de/~pep/

Google Scholar

[11]

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).

Digital Library

Google Scholar

[12]

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).

Digital Library

Google Scholar

[13]

Roig, O.: Formal Verification and Testing of Asynchronous Circuits. PhD thesis, Universitat Politecnica de Catalunya (1997).

Google Scholar

[14]

Sokolov, D., Poliakov, I., Yakovlev, A.: Asynchronous data path models. In: Proc. ACSD 2007 (2007).

Digital Library

Google Scholar

Cited By

View all

Shi YTian CDuan ZZhou M(2016)Model checking Petri nets with MSVLInformation Sciences: an International Journal10.1016/j.ins.2016.01.036363:C(274-291)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1016/j.ins.2016.01.036
Randell B(2011)Occurrence nets then and nowProceedings of the 32nd international conference on Applications and theory of Petri Nets10.5555/2022192.2022194(1-16)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.5555/2022192.2022194

Workcraft --- A Framework for Interpreted Graph Models
1. Computer systems organization
  1. Architectures
    1. Parallel architectures

Recommendations

Interpreted Nets
Special Issue on Concurrency Specification and Programming (CS&P)

The nets considered here are an extension of Petri nets in two aspects. In the semantic aspect, there is no one firing rule common to all transitions, but every transition is treated as an operator on data stored in its entry places and return results ...
Interpreted Nets
Special Issue on Concurrency Specification and Programming (CS&P)

The nets considered here are an extension of Petri nets in two aspects. In the semantic aspect, there is no one firing rule common to all transitions, but every transition is treated as an operator on data stored in its entry places and return results ...
Automatic Handling of Conflicts in Synchronous Interpreted Time Petri Nets Implementation
ISVLSI '14: Proceedings of the 2014 IEEE Computer Society Annual Symposium on VLSI

Several solutions for implementing Petri net models on FPGA thanks to a transformation in a VHDL code have been proposed in literature. But none deals with the management of transition conflicts in the specific case of synchronous implementation of ...

Comments

Information & Contributors

Information

Published In

PETRI NETS '09: Proceedings of the 30th International Conference on Applications and Theory of Petri Nets

June 2009

352 pages

ISBN:9783642024238

Editors:
Giuliana Franceschinis
Dipartimento di Informatica, Università del Piemonte Orientale, Alessandria, Italy 15100
,
Karsten Wolf
Institut für Informatik, Universität Rostock, Rostock, Germany 18051

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 June 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shi YTian CDuan ZZhou M(2016)Model checking Petri nets with MSVLInformation Sciences: an International Journal10.1016/j.ins.2016.01.036363:C(274-291)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1016/j.ins.2016.01.036
Randell B(2011)Occurrence nets then and nowProceedings of the 32nd international conference on Applications and theory of Petri Nets10.5555/2022192.2022194(1-16)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.5555/2022192.2022194

Abstract

References

Cited By

Recommendations

Interpreted Nets

Interpreted Nets

Automatic Handling of Conflicts in Synchronous Interpreted Time Petri Nets Implementation

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations