Performance evaluation of concurrent systems using conflict-free and persistent Petri nets

DOI10.1016/0020-0190(87)90041-XzbMath0654.68063OpenAlexW2001740598MaRDI QIDQ1108799

Jan Magott

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90041-x

zbMATH Keywords

concurrent systemsperformance evaluationpolynomial algorithmsNP-hardnessfiring timecycle time problemthree-partition problemtimed marked Petri nets

Mathematics Subject Classification ID

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

Related Items (1)

Petri net extensions for modelling and validating manufacturing systems

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Performance evaluation of concurrent systems using Petri nets
• Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets
• A decidability theorem for a class of vector-addition systems
• Timing Requirements for Time-Driven Systems Using Augmented Petri Nets
• New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Two-Processor Scheduling with Start-Times and Deadlines
• Properties of Conflict-Free and Persistent Petri Nets

This page was built for publication: Performance evaluation of concurrent systems using conflict-free and persistent Petri nets