Determining best-case and worst-case times of unknown paths in time workflow nets

zbMATH Open1217.68148MaRDI QIDQ632513FDOQ632513

Inga Camerzan

Publication date: 25 March 2011

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

zbMATH Keywords

control flowtime workflow nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (1)

• Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices

   Recommendations

• Extreme runtimes of schedules modelled by time Petri nets 👍 👎
• Time distribution in structural workflow nets 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Program Verification Techniques Based on the Abstract Interpretation Theory 👍 👎

This page was built for publication: Determining best-case and worst-case times of unknown paths in time workflow nets

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