Principles of software engineering management
Principles of software engineering management
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Fundamenta Informaticae - Special issue on graph transformations
Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Communication and Concurrency
Process algebra and Markov chains
Lectures on formal methods and performance analysis
Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
On the integration of delay and throughput measures in distributed processing models
On the integration of delay and throughput measures in distributed processing models
Fault-Tolerant Routing for P2P Systems with Unstructured Topology
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-Based Analysis of Network Reconfigurations Using Graph Transformation Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Model-based stochastic simulation of P2P VoIP using graph transformation system
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Stochastic modelling and simulation of mobile systems
Graph transformations and model-driven engineering
Lightweight testing of communication networks with e-motions
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Advances in model transformations by graph transformation: specification, execution and analysis
Rigorous software engineering for service-oriented systems
Stochastic simulation of graph transformation systems
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Parallelism and concurrency of stochastic graph transformations
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To formalise, measure, and predict these properties, stochastic methods are required. At the same time such systems are characterised by a high degree of architectural reconfiguration. Viewing the architecture of a distributed system as a graph, this is naturally modelled by graph transformations. To address these two concerns, stochastic graph transformation systems have been introduced associating with each rule its application rate—the rate of the exponential distribution governing the delay of its application. Deriving continuous-time Markov chains, Continuous Stochastic Logic is used to specify reliability properties and verify them through model checking. In particular, we study a protocol for the reconfiguration of P2P networks intended to improve their reliability by adding redundant connections. The modelling of this protocol as a (stochastic) graph transformation system takes advantage of negative application and conditions path expressions. This ensuing high-level style of specification helps to reduce the number of states and increases the capabilities for automated analysis.