On the Minimisation of Acyclic Models

DOI10.1007/978-3-540-85361-9_25zbMath1160.68462OpenAlexW1548876510MaRDI QIDQ3541025

Holger Hermanns, Pepijn Crouzen, Li-jun 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)

Related Items (3)

Fault trees on a diet: automated reduction by graph rewriting ⋮ A Tutorial on Interactive Markov Chains ⋮ Equivalence checking 40 years after: a review of bisimulation tools

Cites Work

• Interactive Markov chains. And the quest for quantified quality
• Cones and foci: A mechanical framework for protocol verification
• Matrix multiplication via arithmetic progressions
• CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• Sigref – A Symbolic Bisimulation Tool Box
• Refined Interfaces for Compositional Verification
• Three Partition Refinement Algorithms
• Dynamic fault-tree models for fault-tolerant computer systems
• A theory of normed simulations
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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