Asynchronous Data Path Models

Authors:
Danil Sokolov;Ivan Poliakov;Alex Yakovlev
Affiliations:
University of Newcastle, UK;University of Newcastle, UK;University of Newcastle, UK
Venue:
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Year:
2007

Citing 0
Cited 4

Analysis of Static Data Flow Structures

Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Workcraft --- A Framework for Interpreted Graph Models

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Workcraft: a static data flow structure editing, visualisation and analysis tool

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Analysis of Static Data Flow Structures

Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue

Quantified Score

Hi-index	0.00

Visualization

Abstract

A token-based model for asynchronous data path is formally defined and three token game semantics, spread token, antitoken and counterflow, are introduced. These semantics are studied and their advantages and drawbacks are highlighted. For analysis and comparison a software tool is developed which integrates these models into a consistent framework. The models are verified by mapping them into Petri nets and employing the existing model checking tools.