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">></ETX>
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
