scientific article; zbMATH DE number 1337891

MaRDI QIDQ4264237zbMATH OpenFDO

Authors Louchka Popova-Zeugmann, Dirk Schlatter

Publication date 16 September 1999

zbMATH Keywords

time Petri net

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1534587
• scientific article; zbMATH DE number 4209631
• scientific article; zbMATH DE number 5152608
• scientific article; zbMATH DE number 1534591
• Symbolic Reachability Analysis of Integer Timed Petri Nets

Cited in

(10)

• Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs
• Determining best-case and worst-case times of unknown paths in time workflow nets
• Contracts for cross-organizational workflows as timed dynamic condition response graphs
• An extremum timed extended reachability graph for temporal analysis of time Petri nets
• Quantitative evaluation of time-dependent Petri nets and applications to biochemical networks
• Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
• Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs
• scientific article; zbMATH DE number 744061 (Why is no real title available?)
• scientific article; zbMATH DE number 1534587 (Why is no real title available?)
• scientific article; zbMATH DE number 1534591 (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 Q4264237)