On Weighted Petri Net Transducers

DOI10.1007/978-3-319-07734-5_13zbMath1410.68255OpenAlexW56948752MaRDI QIDQ5166767

Robert Lorenz, Günther J. Wirsching, Markus Q. Huber

Publication date: 8 July 2014

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

Full work available at URL: https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-554112

zbMATH Keywords

Petri netsemiringcleannessweighted transducerPetri net transducerlabelled partial orderconcurrent semiringpartial languageweighted labelled partial orderbisemiring

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers

Uses Software

• PNTooL

Cites Work

• Unnamed Item
• Unnamed Item
• Concurrent Kleene algebra and its foundations
• Branching automata with costs -- a way of reflecting parallelism in costs
• Handbook of weighted automata
• Modeling concurrency with partial orders
• The equational theory of pomsets
• Extending Petri nets for specifying man–machine dialogues

This page was built for publication: On Weighted Petri Net Transducers