Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Stochastic automata networks and near complete decomposability

Author
GUSAK, Oleg1 ; DAYAR, Tugrul1 ; FOURNEAU, Jean-Michel2
[1] Department of Computer Engineering, Bilkent University, 06533 Bilkent, Ankara, Turkey
[2] Lab. PRiSM, Université de Versailles, 45 Avenue des États-Unis, 78035 Versailles, France
Source

SIAM journal on matrix analysis and applications. 2002, Vol 23, Num 2, pp 581-599 ; ref : 24 ref

CODEN
SJMAEL
ISSN
0895-4798
Scientific domain
Computer science; Mathematics
Publisher
Society for Industrial and Applied Mathematics, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Automate stochastique Chaîne Markov Décomposition Processus stochastique Réseau Pétri Décomposabilité presque complète SAN
Keyword (en)
Stochastic automaton Markov chain Decomposition Stochastic process Petri net Near complete decomposability Stochastic automaton network
Keyword (es)
Autómata estocástico Cadena Markov Descomposición Proceso estocástico Red Petri
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02H Probability and statistics / 001A02H01 Probability theory and stochastic processes / 001A02H01J Markov processes

Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis / 001A02I01E Numerical linear algebra

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
13595276

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

Access to the document

Searching the Web