Filters








84 Hits in 3.7 sec

Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation [chapter]

Holger Hermanns, Markus Siegle
1999 Lecture Notes in Computer Science  
This paper addresses the computational complexity of minimisation algorithms and explains how efficient, BDD-based data structures can be employed for this purpose.  ...  Stochastic process algebras have been introduced in order to enable compositional performance analysis.  ...  The second author is supported by the DAAD-Project AZ 313-ARC-XII-98/38 on stochastic modelling and verification.  ... 
doi:10.1007/3-540-48778-6_15 fatcat:7jlyu4novrblfddrruxkp2e7ta

Deriving Symbolic Representations from Stochastic Process Algebras [chapter]

Matthias Kuntz, Markus Siegle
2002 Lecture Notes in Computer Science  
A new denotational semantics for a variant of the stochastic process algebra TIPP is presented, which maps process terms to Multiterminal binary decision diagrams.  ...  It is shown that the new semantics is Markovian bisimulation equivalent to the standard SOS semantics.  ...  Acknowledgements: The authors would like to thank the anonymous referees whose comments helped to fix some technical flaws and improve the presentation of the paper.  ... 
doi:10.1007/3-540-45605-8_12 fatcat:jurtruql3bbohnvs5wemml2byi

Compositional performance modelling with the TIPPtool

H. Hermanns, U. Herzog, U. Klehmet, V. Mertsiotakis, M. Siegle
2000 Performance evaluation (Print)  
Stochastic process algebras have been proposed as compositional specification formalisms for performance models.  ...  It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end.  ...  His research interests include stochastic process algebras and their application to performance and dependability evaluation. Fig. 1 . 1 Basic principles of process algebras.  ... 
doi:10.1016/s0166-5316(99)00056-5 fatcat:g5bc2sukmfa2tjwy3rhjhiomye

Compositional Performance Modelling with the TIPPtool [chapter]

H. Hermanns, U. Herzog, U. Klehmet, V. Mertsiotakis, M. Siegle
1998 Lecture Notes in Computer Science  
Stochastic process algebras have been proposed as compositional specification formalisms for performance models.  ...  It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end.  ...  His research interests include stochastic process algebras and their application to performance and dependability evaluation. Fig. 1 . 1 Basic principles of process algebras.  ... 
doi:10.1007/3-540-68061-6_5 fatcat:6qvkd2tmi5b65ba5ykjjpo6npq

Sigref – A Symbolic Bisimulation Tool Box [chapter]

Ralf Wimmer, Marc Herbstritt, Holger Hermanns, Kelley Strampp, Bernd Becker
2006 Lecture Notes in Computer Science  
Thus, the definition of an appropriate signature is the key for a rapid development of algorithms for other types of bisimulation.  ...  We present a uniform signature-based approach to compute the most popular bisimulations.  ...  Additionally, we are deeply grateful to Markus Siegle and Matthias Kuntz for the supply of the CASPA tool.  ... 
doi:10.1007/11901914_35 fatcat:khzv2xcofzdjxfyh7arwbhpm6e

Multi-core symbolic bisimulation minimisation

Tom van Dijk, Jaco van de Pol
2017 International Journal on Software Tools for Technology Transfer (STTT)  
We present specialised BDD operations to compute the maximal bisimulation using signature-based partition refinement.  ...  We introduce parallel symbolic algorithms for bisimulation minimisation, to combat the combinatorial state space explosion along three different paths.  ...  reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/s10009-017-0468-z fatcat:lkof5aig5ff7rpxcdpuklxjn2m

Multi-core Symbolic Bisimulation Minimisation [chapter]

Tom van Dijk, Jaco van de Pol
2016 Lecture Notes in Computer Science  
We present specialised BDD operations to compute the maximal bisimulation using signature-based partition refinement.  ...  We introduce parallel symbolic algorithms for bisimulation minimisation, to combat the combinatorial state space explosion along three different paths.  ...  reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/978-3-662-49674-9_19 fatcat:nfnqbolkwrgjvmbm2gowea2ilm

CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes [chapter]

Hubert Garavel, Frédéric Lang, Radu Mateescu, Wendelin Serwe
2011 Lecture Notes in Computer Science  
Cadp (Construction and Analysis of Distributed Processes) is a comprehensive software toolbox that implements the results of concurrency theory.  ...  The paper then reviews the main features of Cadp 2010, including compilers for various formal specification languages, equivalence checkers, model checkers, performance evaluation tools, and parallel verification  ...  It implements partition-refinement algorithms based on the notion of state signature [4] .  ... 
doi:10.1007/978-3-642-19835-9_33 fatcat:4fh2thknsfaergm37j6tgbncze

Performance Evaluation:= (Process Algebra + Model Checking) X Markov Chains [chapter]

Holger Hermanns, Joost-Pieter Katoen
2001 Lecture Notes in Computer Science  
Combining process algebra and model checking constitutes a coherent framework for performance evaluation based on CTMCs.  ...  Process algebra provides: (i) a high-level specification formalism for describing CTMCs in a precise, modular and constraint-oriented way, and (ii) means for the automated generation and aggregation of  ...  Twente) and Ulrich Herzog (Univ. Erlangen) have contributed to the work on stochastic process algebra reported here.  ... 
doi:10.1007/3-540-44685-0_6 fatcat:fjczdy3uira6hosgoe5bde3kre

Reachability-based model reduction for Markov decision process

Felipe M Santos, Leliane N Barros, Felipe W Trevizan
2015 Journal of the Brazilian Computer Society  
This paper presents how to improve model reduction for Markov decision process (MDP), a technique that generates equivalent MDPs that can be smaller than the original MDP.  ...  The results show that our approach dominates the current model reduction algorithms and outperforms general MDP solvers in dense problems, i.e., problems in which actions have many probabilistic outcomes  ...  The process stops when all blocks are stable and the resulting partition is a stochastic bisimulation [6] .  ... 
doi:10.1186/s13173-015-0024-1 fatcat:dznkv7z6zveitcagsleueimwli

CADP 2011: a toolbox for the construction and analysis of distributed processes

Hubert Garavel, Frédéric Lang, Radu Mateescu, Wendelin Serwe
2012 International Journal on Software Tools for Technology Transfer (STTT)  
Cadp (Construction and Analysis of Distributed Processes) is a comprehensive software toolbox that implements the results of concurrency theory.  ...  evaluation tools, and parallel verification tools running on clusters and grids.  ...  partition-refinement algorithms ( [79] for strong bisimulation, [65] for branching bisimulation, and [72] for stochastic/probabilistic extensions).  ... 
doi:10.1007/s10009-012-0244-z fatcat:fdch5egwpneebjd3bo6lozyhby

On the use of MTBDDs for performability analysis and verification of stochastic systems

Holger Hermanns, Marta Kwiatkowska, Gethin Norman, David Parker, Markus Siegle
2003 The Journal of Logic and Algebraic Programming  
This paper describes how to employ multi-terminal binary decision diagrams (MTBDDs) for the construction and analysis of a general class of models that exhibit stochastic, probabilistic and non-deterministic  ...  MTBDD-based) representations of complex systems from small-scale components.  ...  The main features of IM-CAT are: (1) Reading of elementary MTSs from file in a simple format as generated by the stochastic process algebra tool TIPPTOOL [53] and generating their MTBDD representation  ... 
doi:10.1016/s1567-8326(02)00066-8 fatcat:mmtbpgznhvcffgqfl2gfclvpli

Model Checking Continuous-Time Markov Chains by Transient Analysis [chapter]

Christel Baier, Boudewijn Haverkort, Holger Hermanns, Joost-Pieter Katoen
2000 Lecture Notes in Computer Science  
., bisimulation), a well-known notion for aggregating CTMCs, preserves all CSL-formulas.  ...  /p( 1 U I 2), for state formulas 1 and 2, comparison operator ./, probability p, and real interval I.  ...  An e ective solution to this problem is to generate CTMCs from higher-level speci cations, like queueing networks, stochastic Petri nets 1], or stochastic process algebras 18, 22] .  ... 
doi:10.1007/10722167_28 fatcat:eiopm7zzvjgmzbhsr5quhvfmp4

Symmetry Reduction for Probabilistic Model Checking [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2006 Lecture Notes in Computer Science  
We then propose an efficient algorithm for the construction of the quotient model using a symbolic implementation based on multi-terminal binary decision diagrams (MTBDDs) and, using four large case studies  ...  We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stochastic characteristics.  ...  BDD-based implementation.  ... 
doi:10.1007/11817963_23 fatcat:abl7efu2unbrvpfdmzoiuzyi7q

Model-checking large structured Markov chains

Peter Buchholz, Joost-Pieter Katoen, Peter Kemper, Carsten Tepper
2003 The Journal of Logic and Algebraic Programming  
This paper presents algorithms and experimental results for model-checking continuous-time Markov chains (CTMCs) based on a structured analysis approach.  ...  Such representations can be obtained in a natural way from various high-level specification formalisms, such as stochastic extensions of Petri nets, process algebras or activity networks.  ...  Examples of significant formalisms which are mapped onto CTMCs are stochastic Petri nets (SPNs) [18] , stochastic process algebras (SPAs) [9, 31, 35] , queueing networks (QNs) [14, 43] and stochastic  ... 
doi:10.1016/s1567-8326(02)00067-x fatcat:veytjj6fyzbnnhp5cycj6nqkx4
« Previous Showing results 1 — 15 out of 84 results