Temporal Petri nets and their application to modeling and analysis of a handshake daisy chain arbiter

Ippei Suzuki, H. Lü

IEEE Transactions on Computers · 1989 · 65 citations · 19 references

Concepts

Abstract

A class of Petri nets called temporal Petri nets is introduced, in which timing constraints are represented by the operators of temporal logic. Due to the versatility of the temporal logic operations to express temporal assertions, temporal Petri nets can describe clearly and compactly causal and temporal relationships between the events of a system, including eventuality and fairness. The use of temporal Petri nets is illustrated with a nontrivial example of modeling and analysis of a handshake daisy-chain arbiter.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

References

19