Net-based analysis of event processing networks -- the fast flower delivery case

DOI10.1007/978-3-642-38697-8_15zbMATH Open1381.90056OpenAlexW33074813MaRDI QIDQ5300877FDOQ5300877

Authors: Matthias Weidlich, Jan Mendling, Avigdor Gal 

Publication date: 28 June 2013

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38697-8_15

Recommendations

• The practitioner's guide to coloured Petri nets.
• scientific article; zbMATH DE number 1049168
• Modelling and evaluation of time aspects in business processes
• Performance modelling of event-condition-action rules in P2P networks
• scientific article; zbMATH DE number 4028914

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Operations research and management science (90B99)

Cited In (1)

• Reasoning on the efficiency of distributed complex event processing

This page was built for publication: Net-based analysis of event processing networks -- the fast flower delivery case

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