On weighted Petri net transducers

DOI10.1007/978-3-319-07734-5_13MaRDI QIDQ5166767zbMATH OpenOpenAlexFDO

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

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

bisemiringcleannessconcurrent semiringlabelled partial orderpartial languagePetri netPetri net transducersemiringweighted labelled partial orderweighted transducer

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)

Recommendations

• Modeling quantitative aspects of concurrent systems using weighted Petri net transducers
• scientific article; zbMATH DE number 4085040
• scientific article; zbMATH DE number 2143011
• Weighted extended tree transducers
• scientific article; zbMATH DE number 4098730

Cites work

• Branching automata with costs -- a way of reflecting parallelism in costs
• Concurrent Kleene algebra and its foundations
• Extending Petri nets for specifying man–machine dialogues
• Handbook of weighted automata
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 3995041 (Why is no real title available?)
• Modeling concurrency with partial orders
• The equational theory of pomsets

Cited in

(2)

• Modeling quantitative aspects of concurrent systems using weighted Petri net transducers
• scientific article; zbMATH DE number 4085040 (Why is no real title available?)

Describes a project that uses

Uses Software

• PNTooL

This page was built for publication: On weighted Petri net transducers

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