A Restricted Reachability Problem of Petri Nets Solvable in Pseudo-Polynomial Time
TRANSACTIONS- SOCIETY OF INSTRUMENT AND CONTROL ENGINEERS ; 29 , 11 ; 1352
1993-01-01
1352 pages
Aufsatz (Zeitschrift)
Unbekannt
DDC: | 629.8 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
A Polynomial Time Solvable Formulation of Multiple Sequence Alignment
British Library Conference Proceedings | 2005
|British Library Online Contents | 1997
|Generating Real-time Software Test Cases by Time Petri Nets
British Library Online Contents | 2000
|Operating rules description using Petri nets
Tema Archiv | 2007
|Stochastic petri nets for risk assessment
Tema Archiv | 2008
|