Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=PASCAL7830111155

COMPLEXITY OF SOME PROBLEMS IN PETRI NETS.

Author
JONES ND; LANDWEBER LH; LIEN YE
DEP. COMPUT. SCI., UNIV. KANSAS, LAWRENCE, KANS. 66045, USA
Source
THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 3; PP. 277-299; BIBL. 1 P.
Document type
Article
Language
English
Keyword (fr)
INFORMATIQUE INFORMATIQUE THEORIQUE RESEAU PETRI TRAITEMENT PARALLELE COMPLEXITE CALCUL THEORIE GRAPHE AUTOMATE MODELE SIMULATION INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
COMPUTER SCIENCE COMPUTER THEORY PETRI NET PARALLEL PROCESSING COMPUTING COMPLEXITY GRAPH THEORY AUTOMATON SIMULATION MODEL COMPUTER SCIENCES APPLIED MATHEMATICS
Keyword (es)
INFORMATICA MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL7830111155

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web