Communicating sequential processes
Communicating sequential processes
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Communication and concurrency
Probability, statistics, and queueing theory with computer science applications
Probability, statistics, and queueing theory with computer science applications
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A causal operational semantics of action refinement
Information and Computation
From CML to its process algebra
Theoretical Computer Science
Enhanced operational semantics
ACM Computing Surveys (CSUR)
A compositional approach to performance modelling
A compositional approach to performance modelling
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Designing distributed applications with mobile code paradigms
ICSE '97 Proceedings of the 19th international conference on Software engineering
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
Information and Computation
Non-interleaving semantics for mobile processes
Theoretical Computer Science
Evaluating the tradeoffs of mobile code design paradigms in network management applications
Proceedings of the 20th international conference on Software engineering
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Applying techniques of asynchronous concurrency to synchronous languages
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The ESTEREL Synchronous Programming Language and its Mathematical Semantics
Seminar on Concurrency, Carnegie-Mellon University
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Understanding Mobile Agents via a Non-Interleaving Semantics for Facile
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Partial ordering derivations for CCS
FCT '85 Fundamentals of Computation Theory
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A formal approach to reactive systems software: a telecommunications application in ESTEREL
WIFT '95 Proceedings of the 1st Workshop on Industrial-Strength Formal Specification Techniques
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
Language-based performance prediction for distributed and mobile systems
Information and Computation
Performance Validation of Mobile Software Architectures
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Causal pi-Calculus for Biochemical Modelling
CMSB '03 Proceedings of the First International Workshop on Computational Methods in Systems Biology
Simulation and verification I: design environments for complex systems
Proceedings of the 35th conference on Winter simulation: driving innovation
Modelling biochemical pathways through enhanced π-calculus
Theoretical Computer Science - Special issue: Computational systems biology
Control Flow Analysis for BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
Toward Extracting π-calculus from UML Sequence and State Diagrams
Electronic Notes in Theoretical Computer Science (ENTCS)
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)
Cells in silico: a holistic approach
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Performance evaluation of DPS coordination strategies modelled in pi-calculus
International Journal of Intelligent Information and Database Systems
On evaluating the performance of security protocols
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Performance analysis of mobile systems
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
| Hi-index | 0.00 |
We use a structural operational semantics which drives us in inferring quantitative measures on system evolution. The transitions of the system are labeled and we assign rates to them by only looking at these labels. The rates reflect the possibly distributed architecture on which applications run. We then map transition systems to Markov chains, and performance evaluation is carried out using standard tools. As a working example, we compare the performance of a conventional uniprocessor with a prefetch pipeline machine. We also consider two case studies from the literature involving mobile computation to show that our framework is feasible.