Asynchronous composition of high level Petri Nets: A quantitative approach

DOI10.1007/3-540-61363-3_11zbMath1418.68141OpenAlexW1575092567MaRDI QIDQ4633162

Patrice Moreaux, Serge Haddad

Publication date: 2 May 2019

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

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_11

zbMATH Keywords

discrete-time Markov chainsyntactic conditionabstract viewsemantic conditiontensor expression

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Privacy and safety analysis of timed stochastic discrete event systems using Markovian trajectory-observers ⋮ Block SOR for Kronecker structured representations ⋮ Approximated timed reachability graphs for the robust control of discrete event systems

Uses Software

• GreatSPN
• GreatSPN 1.7

Cites Work

• Unnamed Item
• Sub-stochastic matrix analysis for bounds computation -- theoretical results
• GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Kronecker products and shuffle algebra

This page was built for publication: Asynchronous composition of high level Petri Nets: A quantitative approach