On the Minimisation of Acyclic Models

DOI10.1007/978-3-540-85361-9_25MaRDI QIDQ3541025zbMATH OpenOpenAlexFDO

Authors Pepijn Crouzen, Holger Hermanns, Lijun Zhang

Publication date 25 November 2008

Published in CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85361-9_25

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
• scientific article; zbMATH DE number 1759621
• Simulation-based minimization
• An efficient algorithm for computing bisimulation equivalence

Cites work

• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• A theory of normed simulations
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• CADP 2010: a toolbox for the construction and analysis of distributed processes
• Cones and foci: A mechanical framework for protocol verification
• Distributed branching bisimulation reduction of state spaces
• Dynamic fault-tree models for fault-tolerant computer systems
• scientific article; zbMATH DE number 3958732 (Why is no real title available?)
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 177845 (Why is no real title available?)
• scientific article; zbMATH DE number 3635493 (Why is no real title available?)
• scientific article; zbMATH DE number 2080055 (Why is no real title available?)
• scientific article; zbMATH DE number 1796125 (Why is no real title available?)
• scientific article; zbMATH DE number 1796138 (Why is no real title available?)
• Interactive Markov chains. And the quest for quantified quality
• Matrix multiplication via arithmetic progressions
• Refined Interfaces for Compositional Verification
• Revisiting interactive Markov chains
• Sigref – A Symbolic Bisimulation Tool Box
• Three Partition Refinement Algorithms

Cited in

(5)

• Fault trees on a diet: automated reduction by graph rewriting
• A Tutorial on Interactive Markov Chains
• Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction
• scientific article; zbMATH DE number 6785324 (Why is no real title available?)
• Equivalence checking 40 years after: a review of bisimulation tools

This page was built for publication: On the Minimisation of Acyclic Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541025)