default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 30 matches
- 1989
- Hany H. Ammar, S. M. Rezaul Islam:
On Bounds for Token Probabilities in a Class of Generalized Stochastic Petri Nets. PNPM 1989: 221-227 - Hany H. Ammar, S. M. Rezaul Islam, Su Deng:
Performability Analysis of Parallel and Distributed Algorithms. PNPM 1989: 240-248 - Jonathan Billington:
Extensions to Coloured Petri Nets. PNPM 1989: 61-70 - Jonathan Billington:
Many-Sorted High-Level Nets. PNPM 1989: 166-179 - Alex Blakemore:
The Cost of Eliminating Vanishing Markings from Generalized Stochastic Petri Nets. PNPM 1989: 85-92 - Steven C. Bruell, Pozung Chen, Gianfranco Balbo:
Alternative Methods for Incorporating Non-exponential Distributions into Stochastic Timed Petri Nets. PNPM 1989: 187-197 - Javier Campos, Giovanni Chiola, José Manuel Colom, Manuel Silva Suárez:
Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. PNPM 1989: 200-209 - Javier Campos, Giovanni Chiola, Manuel Silva Suárez:
Properties and Steady-State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector. PNPM 1989: 210-220 - Juan A. Carrasco:
Automated Construction of Compound Markov Chains from Generalized Stochastic High-Level Petri Nets. PNPM 1989: 93-102 - Giovanni Chiola, Giuliana Franceschinis:
Colored GSPN Models and Automatic Symmetry Detection. PNPM 1989: 50-60 - Peter P. K. Chiu, Paul Y. S. Cheung:
Logic Simulation with Interval-Labelled Net Model. PNPM 1989: 132-141 - Gianfranco Ciardo, Jogesh K. Muppala, Kishor S. Trivedi:
SPNP: Stochastic Petri Net Package. PNPM 1989: 142-151 - Joanne Bechta Dugan, Dan C. Marinescu, Giovanni Chiola, Yoshio Sugasawa, William H. Sanders, Gianfranco Ciardo:
Panel: Applications of Performance Petri Nets. PNPM 1989: 164 - Claude Dutheillet, Serge Haddad:
Aggregation of States in Colored Stochastic Petri Nets: Application to a Multiprocessor Architecture. PNPM 1989: 40-49 - Gerard Florin, Stéphane Natkin:
Matrix Product Form Solution for Closed Synchronized Queuing Networks. PNPM 1989: 29-37 - Itsuo Hatono, Norihiro Katoh, Keiichi Yamagata, Hiroyuki Tamura:
Modeling of FMS under Uncertainty Using Stochastic Petri Nets. PNPM 1989: 122-129 - William Henderson, Peter G. Taylor:
Aggregation Methods in Exact Performance Analyssi of Stochastic Petri Nets. PNPM 1989: 12-18 - Oliver C. Ibe, Archana Sathaye, Richard C. Howe, Kishor S. Trivedi:
Stochastic Petri Net Modeling of VAXcluster System Availability. PNPM 1989: 112-121 - Guy Juanole, J. L. Roux:
On the Pertinence of the Extended Time Petri Net Model for Analyzing Communication Activities. PNPM 1989: 230-239 - Jan Magott, Kamil Skudlarski:
Combining Generalized Stochastic Petri Nets and PERT Networks for the Performance Evaluation of Concurrent Progress. PNPM 1989: 249-256 - Marco Ajmone Marsan, Susanna Donatelli, Fabio Neri:
GSPN Models of Multiserver Multiqueue Systems. PNPM 1989: 19-28 - Marco Ajmone Marsan, Gian Paolo Rossi, F. Salvi:
A Simulation Model of a Uniform Interface for Layered Protocol Architectures. PNPM 1989: 152-161 - Michael K. Molloy:
Petri Net Modelling - The Past, the Present, and the Future. PNPM 1989: 2-9 - Keiko Nakamura, Kiyohiko Nakamura, Atsunobu Ichikawa:
A Class of Petri Nets and a Reachability Problem Solvable in Deterministic Polynomial Time. PNPM 1989: 258-265 - William H. Sanders, John F. Meyer:
Reduced Base Model Construction Methods for Stochastic Activity Networks. PNPM 1989: 74-84 - Harushi Someya, Tsutomu Tashiro, Tomohiro Murata, Norihisa Komoda:
Performance Evaluation of Job Operation Flows in Computer Systems by Timed Petri Nets. PNPM 1989: 104-111 - Toshimasa Watanabe, Yukata Mizobata, Kenji Onaga:
Legal Firing Sequence and Related Problems of Petri Nets. PNPM 1989: 277-286 - Yuh Yaw, Fuin-Law, Wei-De Ju:
The Algorithm of a Synthesis Technique for Concurrent Systems. PNPM 1989: 266-276 - Wlodzimierz M. Zuberek:
Performance Evaluation Using Unbounded Timed Petri Nets. PNPM 1989: 180-186 - Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM 1989, Kyoto, Japan, December 11-13, 1989. IEEE Computer Society 1989, ISBN 0-8186-2001-3 [contents]
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-19 12:21 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint