scientific article; zbMATH DE number 2058666

MaRDI QIDQ4455309zbMATH OpenFDO

Authors Huifang Li, Yushun Fan

Publication date 16 March 2004

zbMATH Keywords

Timing Constraint Petri Nets

Mathematics Subject Classification ID

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

Recommendations

• Timing constraint Petri nets and their schedulability analysis and verification
• Timing constraint Petri nets and their schedulability analysis and verification
• Scheduling and control of real-time systems based on a token player approach
• Analysis of RTCP-nets with reachability graphs
• Analysis of reachability and prohibitibility of a class of coloured Petri nets with interval timed arcs

Cited in

(7)

• Schedulability analysis of timed regular tasks by under-approximation on WCET
• Analysis of scheduling behaviour using generic timed automata
• scientific article; zbMATH DE number 1686287 (Why is no real title available?)
• Timing constraint Petri nets and their schedulability analysis and verification
• Timing constraint Petri nets and their schedulability analysis and verification
• Near-Optimal Scheduling for Petri Net Models With Forbidden Markings
• scientific article; zbMATH DE number 5499378 (Why is no real title available?)

This page was built for publication:

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