Timed Petri Nets: Probabilistic Selection Of Data Dependent Paths

DOI10.1080/00207169008803922MaRDI QIDQ3479509zbMATH OpenOpenAlexFDO

Authors Hossam Mahmoud Ahmad Fahmy

Publication date 1990

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169008803922

zbMATH Keywords

data dependent pathsprobabilistic Petri netsReal-time systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Probabilistic time Petri nets
• scientific article; zbMATH DE number 1228291
• scientific article; zbMATH DE number 1751909
• The right timing: reflections on the modeling and analysis of time
• A brief survey and synthesis of the roles of time in Petri nets.

Cites work

• Discrete Time Stochastic Petri Nets
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Timing Requirements for Time-Driven Systems Using Augmented Petri Nets

Cited in

(1)

• Probabilistic time Petri nets

This page was built for publication: Timed Petri Nets: Probabilistic Selection Of Data Dependent Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479509)