Free-choice Petri nets-an algebraic approach
From MaRDI portal
Publication:3124460
DOI10.1109/9.545714zbMath1041.93500OpenAlexW2155647173MaRDI QIDQ3124460
Bruno Gaujal, François Baccelli, Sergeĭ Georgievich Foss
Publication date: 1996
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/61fd146f056e7aa0a44e305a4ed135aba1c91fbc
Hierarchical systems (93A13) Control/observation systems in abstract spaces (93C25) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Theory of computing (68Q99)
Related Items (4)
Networked conflicting timed event graphs representation in (Max,+) algebra ⋮ Blocking a transition in a free choice net and what it tells about its throughput. ⋮ Reliability analysis of complex robotic system using Petri nets and fuzzy lambda‐tau methodology ⋮ Modelling routing phenomenon with bounds estimation in dioids
This page was built for publication: Free-choice Petri nets-an algebraic approach