Net-Based Analysis of Event Processing Networks – The Fast Flower Delivery Case

From MaRDI portal

Revision as of 21:49, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5300877

Jump to:navigation, search

DOI10.1007/978-3-642-38697-8_15zbMath1381.90056OpenAlexW33074813MaRDI QIDQ5300877

Jan Mendling, Matthias Weidlich, 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

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)

Related Items (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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5300877&oldid=19964822"