Stochastic activity networks: formal definitions and concepts
Lectures on formal methods and performance analysis
The Möbius Framework and Its Implementation
IEEE Transactions on Software Engineering
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
MOTOR: the MODEST tool environment
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
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
Does clock precision influence ZigBee's energy consumptions?
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Location-aware quality of service measurements for service-level agreements
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Ten years of performance evaluation for concurrent systems using CADP
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
CADP 2010: a toolbox for the construction and analysis of distributed processes
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
A longstanding problem with generalized stochastic Petri nets and extensions is that of what to do when more than one zero-timed event is scheduled to occur at the same time. If the order is left unspecified, it could lead to ambiguity that affects reward variables. Stochastic activity nets (SANs) [6,7] have used the well-specified condition to avoid this problem. However, the existing algorithm to perform the well-specified check is computationally complex, proportional to the number of paths through unstable markings. We provide some theoretical results that allow us to make use of a much more efficient algorithm, with complexity proportional to the number of arcs between unstable markings.