Model Refinement Using Bisimulation Quotients

DOI10.1007/978-3-642-17796-5_5zbMath1308.68040DBLPconf/amast/GluckMS10OpenAlexW2107931451WikidataQ62039041 ScholiaQ62039041MaRDI QIDQ3067468

Roland Glück, Michel Sintzoff, Bernhard Möller

Publication date: 21 January 2011

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/58784

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Two Observations in Dioid Based Model Refinement ⋮ Compatibility of refining and controlling plant automata with bisimulation quotients ⋮ Isolated sublattices and their application to counting closure operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence notions and model minimization in Markov decision processes
• CCS expressions, finite state processes, and three problems of equivalence
• Graphs, dioids and semirings. New models and algorithms.
• Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
• A Semiring Approach to Equivalences, Bisimulations and Control
• A classification of symbolic transition systems

This page was built for publication: Model Refinement Using Bisimulation Quotients