Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers

DOI10.1007/978-3-319-19488-2_3zbMath1432.68313OpenAlexW1189417022MaRDI QIDQ2941142

Robert Lorenz

Publication date: 27 August 2015

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

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/55410/55410.pdf

zbMATH Keywords

Petri netsemiringcleannessweighted transducerPetri net transducerlabelled partial orderbi-semiringconcurrent semiringpartial languageweighted labelled partial order

Mathematics Subject Classification ID

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

Related Items (1)

PNTooL

Uses Software

• SNAKES

Cites Work

• Unnamed Item
• 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
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• Extending Petri nets for specifying man–machine dialogues
• An open graph visualization system and its applications to software engineering
• Models from Scenarios
• Semirings and Formal Power Series
• Weighted Automata Algorithms
• Weighted Tree Automata and Tree Transducers
• Traces, Series-Parallel Posets, and Pictures: A Weighted Study
• On Weighted Petri Net Transducers
• Advances in Petri nets 1992

This page was built for publication: Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers