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 34 matches
- 1995
- Gianfranco Balbo:
On the success of stochastic Petri nets. PNPM 1995: 2-9 - Marco Bernardo, Lorenzo Donatiello, Roberto Gorrieri:
Giving a net semantics to Markovian process algebra. PNPM 1995: 169-178 - Andrea Bobbio, Vidyadhar G. Kulkarni, Antonio Puliafito, Miklós Telek, Kishor S. Trivedi:
Preemptive repeat identical transitions in Markov regenerative stochastic Petri nets. PNPM 1995: 113-122 - Ed Brinksma:
Performance and formal design: a process algebraic perspective. PNPM 1995: 124-125 - Peter Buchholz, Peter Kemper:
Numerical analysis of stochastic marked graph nets. PNPM 1995: 32-41 - Giovanni Chiola:
Characterization of timed well-formed Petri nets behavior by means of occurrence equations. PNPM 1995: 127-136 - Gianfranco Ciardo, Ludmila Cherkasova, Vadim E. Kotov, Tomas Rokicki:
Modeling a scalable high-speed interconnect with stochastic Petri nets. PNPM 1995: 83-92 - Pierre Cubaud:
Performance evaluation of non-Markovian stochastic event graphs. PNPM 1995: 94-102 - Daniel D. Deavours, W. Douglas Obal II, Muhammad A. Qureshi, William H. Sanders, Aad P. A. van Moorsel:
UltraSAN version 3 overview. PNPM 1995: 216-217 - Susanna Donatelli, Marina Ribaudo, Jane Hillston:
A comparison of performance evaluation process algebra and generalized stochastic Petri nets. PNPM 1995: 158-168 - Marco A. Escalante, Nikitas J. Dimopoulos, Dilyan Gyuroff, Hausi A. Müller:
Timing analysis for synthesis of hardware interface controllers using timed signal transition graphs. PNPM 1995: 232-240 - Angela Di Febbraro, Riccardo Minciardi, Simona Sacone:
Performance optimization of event graphs modeling manufacturing systems. PNPM 1995: 203-204 - Rossano Gaeta, Giovanni Chiola:
Efficient simulation of SWN models. PNPM 1995: 137-146 - Reinhard German, Christian Kelling, Armin Zimmermann, Günter Hommel:
TimeNET-a toolkit for evaluating non-Markovian stochastic Petri nets. PNPM 1995: 210-211 - Reinhard German, Dimitris Logothetis, Kishor S. Trivedi:
Transient analysis of Markov regenerative stochastic Petri nets: a comparison of approaches. PNPM 1995: 103-112 - Stefan Greiner, Antonio Puliafito, Gunter Bolch, Kishor S. Trivedi:
Performance evaluation of dynamic priority operating systems. PNPM 1995: 241-250 - Peter J. Haas, Gerald S. Shedler:
One-dependent cycles and passage times in stochastic Petri nets. PNPM 1995: 191-202 - Serge Haddad, Patrice Moreaux:
Evaluation of high level Petri nets by means of aggregation and decomposition. PNPM 1995: 11-20 - Boudewijn R. Haverkort, Aad P. A. van Moorsel:
Using the probabilistic evaluation tool for the analytical solution of large Markov models. PNPM 1995: 206-207 - Peter Kemper:
Numerical analysis of superposed GSPNs. PNPM 1995: 52-61 - Jean-Claude Laprie, Mohamed Kaâniche, Karama Kanoun:
Modeling computer systems evolutions: non-stationary processes and stochastic Petri nets-application to dependability growth. PNPM 1995: 221-230 - Carl Hugo Lindemann:
Stochastic modeling using DSPNexpress. PNPM 1995: 208-209 - Baopu Liu, A. Robbi:
TiPNet: a graphical tool for timed Petri nets. PNPM 1995: 212-213 - Manish Madhukar, Michael R. Leuze, Lawrence W. Dowdy:
Petri net model of a dynamically partitioned multiprocessor system. PNPM 1995: 73-82 - Varsha Mainkar, Kishor S. Trivedi:
Fixed point iteration using stochastic reward nets. PNPM 1995: 21-30 - Luai M. Malhis, William H. Sanders, Richard D. Schlichting:
Numerical evaluation of a group-oriented multicast protocol using stochastic activity networks. PNPM 1995: 63-72 - David M. Nicol, Andrew S. Miner:
The fluid stochastic Petri net simulator. PNPM 1995: 214-215 - Muhammad A. Qureshi, William H. Sanders, Aad P. A. van Moorsel, Reinhard German:
Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures. PNPM 1995: 180-190 - Marina Ribaudo:
Stochastic Petri net semantics for stochastic process algebras. PNPM 1995: 148-157 - Matteo Sereno:
Approximate mean value analysis technique for non-product form solution stochastic Petri nets: an application to stochastic marked graphs. PNPM 1995: 42-51
skipping 4 more matches
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 2025-01-02 10:52 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