A Time Petri Net Extended with Price Information
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Performance and cost analysis are the two main purposes of business process modeling, where the Petri net extended with time information is an effective tool for performance analysis, but not for cost analysis. This paper proposes a time Petri net extended with price information—Price Time Petri Net. Firstly, this paper associates a price with a time transition, and gives the semantics for price time Petri net in terms of priced timed transition systems. Then it defines a priced state class as an extension of state class, and discusses the soundness and completeness for this extension. An algorithm is given to prove that the minimum-cost reachability problem for bounded price time Petri net is decidable. Finally, this paper gives an example and draws a conclusion that incorporating price information in time Petri net and applying price time Petri net to business process management
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT
van der Aalst, W. M. P. (1998) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126698000043 · Cited by 3,074
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Ramchandani, C. (1974) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 843
Minimum-Cost Reachability for Priced Time Automata
Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., & Vaandrager, F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45351-2_15 · Cited by 303
Optimal scheduling using priced timed automata
Behrmann, G., Larsen, K. G., & Rasmussen, J. I. (2005) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1059816.1059823 · Cited by 151
Cited by
Partial Least Squares Methods: Partial Least Squares Correlation and Partial Least Square Regression
Abdi, H., & Williams, L. J. (2013) · Methods in Molecular Biology · doi:10.1007/978-1-62703-059-5_23 · Cited by 448
A review on machine learning principles for multi-view biological data integration
Li, Y., Wu, F.-X., & Ngom, A. (2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbw113 · Cited by 421
Serbin, S. P., Singh, A., McNeil, B. E., Kingdon, C. C., & Townsend, P. A. (2014) · Ecological Applications · doi:10.1890/13-2110.1 · Cited by 360
Efficient Approximate Bayesian Computation Coupled With Markov Chain Monte Carlo Without Likelihood
Wegmann, D., Leuenberger, C., & Excoffier, L. (2009) · Genetics · doi:10.1534/genetics.109.102509 · Cited by 348
Genome interplay in the grain transcriptome of hexaploid bread wheat
Pfeifer, M., Kugler, K. G., Sandve, S. R., Zhan, B., Rudi, H., Hvidsten, T. R., International Wheat Genome Sequencing Consortium, Mayer, K. F. X., & Olsen, O.-A. (2014) · Science · doi:10.1126/science.1250091 · Cited by 340
Metadata
- Authors
- LIU, X.-M.
- Venue
- Journal of Software
- Published
- 2007
- Volume
- 18
- Issue
- 1
- Pages
- 1
- ISSN
- 1000-9825 (ISSN-L)
- OpenAlex
- W2125117729
- Cited by
- 268
- References
- 4
- FWCI
- 9.52
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.