Approximate Throughput Computation of Stochastic Marked Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tse/CamposCJS94
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tse/CamposCJS94
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hauke_Jungnitz
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Javier_Campos
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jos%E2%88%9A%C2%A9_Manuel_Colom
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Manuel_Silva_Su%E2%88%9A%C2%B0rez
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F32.297941
>
foaf:
homepage
<
https://doi.org/10.1109/32.297941
>
dc:
identifier
DBLP journals/tse/CamposCJS94
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F32.297941
(xsd:string)
dcterms:
issued
1994
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tse
>
rdfs:
label
Approximate Throughput Computation of Stochastic Marked Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hauke_Jungnitz
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Javier_Campos
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jos%E2%88%9A%C2%A9_Manuel_Colom
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Manuel_Silva_Su%E2%88%9A%C2%B0rez
>
swrc:
number
7
(xsd:string)
swrc:
pages
526-535
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tse/CamposCJS94/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tse/CamposCJS94
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tse/tse20.html#CamposCJS94
>
rdfs:
seeAlso
<
https://doi.org/10.1109/32.297941
>
dc:
subject
Petri nets; stochastic processes; performance evaluation; approximate throughput computation; stochastic marked graphs; iterative technique; stochastic strongly connected marked graphs; net decomposition; single input-single output cut; qualitative behavior; general decomposition technique; iterative response time approximation method; error; state space; intractable systems; stochastic Petri net models
(xsd:string)
dc:
title
Approximate Throughput Computation of Stochastic Marked Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
20
(xsd:string)