ACM Transactions on Computer Systems (TOCS)
Discrete Time Stochastic Petri Nets
IEEE Transactions on Software Engineering
The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets
IEEE Transactions on Software Engineering
Markov regenerative stochastic Petri nets
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
IEEE Transactions on Software Engineering
A Characterization of the Stochastic Process Underlying a Stochastic Petri Net
IEEE Transactions on Software Engineering
International Workshop on Timed Petri Nets
Generalized Stochastic Petri Nets Revisitied: Random Switches and Priorities
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
On Petri nets with deterministic and exponentially distributed firing times
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Transient Analysis of Deterministic and Stochastic Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
On the integration of delay and throughput measures in distributed processing models
On the integration of delay and throughput measures in distributed processing models
Construction and solution of performability models based on stochastic activity networks
Construction and solution of performability models based on stochastic activity networks
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
A Modeling Framework to Implement Preemption Policies in Non-Markovian SPNs
IEEE Transactions on Software Engineering
Stochastic activity networks: formal definitions and concepts
Lectures on formal methods and performance analysis
Petri Net Modelling and Performability Evaluation with TimeNET 3.0
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
A multiview approach to modeling and analysis of discrete event systems
Systems Analysis Modelling Simulation
Well-Defined Generalized Stochastic Petri Nets: A Net-Level Method to Specify Priorities
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems
IEEE Transactions on Software Engineering
A set of performance and dependability analysis components for CADP
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A new approach to the evaluation of non markovian stochastic petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Wireless Personal Communications: An International Journal
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
Formalisms based on stochastic Petri Nets (SPNs) can employ structural analysis to ensure that the underlying stochastic process is fully determined. The focus is on the detection of conflicts and confusions at the net level, but this might require to overspecify a given SPN model. The problem becomes even more critical when reward processes of interest derived from the basic underlying process are considered. Typical examples are state-dependent impulse reward measures. We propose a definition of well-defined SPNs, which takes into account whether the basic underlying stochastic process or the derived reward processes are determined. A state-space-based algorithm to determine whether a given SPN is well-defined is provided.