Process algebras are getting mature for performance evaluation?!
ACM SIGMETRICS Performance Evaluation Review
Performance Evaluation of Mobile Processes via Abstract Machines
IEEE Transactions on Software Engineering
Process algebra for performance evaluation
Theoretical Computer Science
Formal methods for performance evaluation
Lectures on formal methods and performance analysis
Process algebra and Markov chains
Lectures on formal methods and performance analysis
Language-based performance prediction for distributed and mobile systems
Information and Computation
Quantifying the Dynamic Behavior of Process Algebras
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Deriving Symbolic Representations from Stochastic Process Algebras
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
TIPPtool: Compositional Specification and Analysis of Markovian Performance Models
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Compositional Performance Modelling with TIPPtool
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Weak bisimulation for (max/+) automata and related 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)
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
Bisimulation relations for weighted automata
Theoretical Computer Science
Theoretical Computer Science
QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
Fundamenta Informaticae - Application of Concurrency to System Design
On a Uniform Framework for the Definition of Stochastic Process Languages
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Performance Evaluation of Security Protocols Specified in LySa
Electronic Notes in Theoretical Computer Science (ENTCS)
A Quantitative Study of Two Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Partially-shared zero-suppressed multi-terminal BDDs: concept, algorithms and applications
Formal Methods in System Design
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
On evaluating the performance of security protocols
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
Fundamenta Informaticae - Application of Concurrency to System Design
A uniform definition of stochastic process calculi
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |