ACM Transactions on Computer Systems (TOCS)
A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
GSPN models of Markovian multiserver multiqueue systems
Performance Evaluation
A methodology for solving Markov models of parallel systems
Journal of Parallel and Distributed Computing
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Numerical Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Efficient descriptor-vector multiplications in stochastic automata networks
Journal of the ACM (JACM)
"On-the-Fly" Solution Techniques for Stochastic Petri Nets and Extensions
IEEE Transactions on Software Engineering
System-level power/performance analysis for embedded systems design
Proceedings of the 38th annual Design Automation Conference
Process algebra for performance evaluation
Theoretical Computer Science
Triangular solution of linear systems in tensor product format
ACM SIGMETRICS Performance Evaluation Review
Process algebra and Markov chains
Lectures on formal methods and performance analysis
Representing software usage models with stochastic automata networks
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
Some Ergodic Results on Stochastic Iterative Discrete Events Systems
Discrete Event Dynamic Systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Transient Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering
The Möbius Framework and Its Implementation
IEEE Transactions on Software Engineering
Overview: An Integrated Framework for Performance Engineering and Resource-Aware Compilation
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Modular State Level Analysis of Distributed Systems Techniques and Tool Support
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Numerical Evaluation of Stochastic Automata Networks
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Performance Evaluation: = (Process Algebra + Model Checking) × Markov Chains
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Performance Evaluation: Origins and Directions
Kronecker Algebra and (Stochastic) Petri Nets: Is It Worth the Effort?
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Evaluation of high level Petri nets by means of aggregation and decomposition
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Numerical analysis of superposed GSPNs
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Transient Analysis of Superposed GSPNs
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks
Performance Evaluation
The Kronecker product and stochastic automata networks
Journal of Computational and Applied Mathematics
Model-Based Evaluation: From Dependability to Security
IEEE Transactions on Dependable and Secure Computing
On the benefits of using functional transitions and Kronecker algebra
Performance Evaluation
Modular Analytical Performance Models for Ad Hoc Wireless Networks
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Product-form and stochastic Petri nets: a structural approach
Performance Evaluation
Computation and communication refinement for multiprocessor SoC design: A system-level perspective
Proceedings of the 41st annual Design Automation Conference
Analytical modeling of random waypoint mobility patterns
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Split: a flexible and efficient algorithm to vector-descriptor product
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Perfect Simulation of Stochastic Automata Networks
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Compositionality for Markov reward chains with fast and silent transitions
Performance Evaluation
Performance Models For Master/Slave Parallel Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Analytical Modeling for Operating System Schedulers on NUMA Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Rewriting logic and probabilities
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Performance modelling and Markov chains
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Compositionality for Markov reward chains with fast transitions
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Abstract interpretation for worst and average case analysis
Program analysis and compilation, theory and practice
Collaboration of discrete-time Markov chains: Tensor and product form
Performance Evaluation
ACM Computing Surveys (CSUR)
Approximated tensor sum preconditioner for stochastic automata networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Abstraction-based performance verification of NoCs
Proceedings of the 48th Design Automation Conference
Triangular and skew-symmetric splitting method for numerical solutions of Markov chains
Computers & Mathematics with Applications
Correct transformation: From object-based graph grammars to PROMELA
Science of Computer Programming
A framework to decompose GSPN models
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Efficient vector-descriptor product exploiting time-memory trade-offs
ACM SIGMETRICS Performance Evaluation Review
Performance evaluation of business processes through a formal transformation to SAN
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Modeling and analysis of CPU usage in safety-critical embedded systems to support stress testing
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Performance evaluation of sensor networks by statistical modeling and euclidean model checking
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.01 |
A methodology for modeling a system composed of parallel activities with synchronization points is proposed. Specifically, an approach based on a modular state-transition representation of a parallel system called the stochastic automata network (SAN) is developed. The state-space explosion is handled by a decomposition technique. The dynamic behavior of the algorithm is analyzed under Markovian assumptions. The transition matrix of the chain is automatically derived using tensor algebra operators, under a format which involves a very limited storage cost.