Partition refinement of component interaction automata

DOI10.1016/j.scico.2011.10.014zbMath1264.68060OpenAlexW2046349244MaRDI QIDQ1951613

Markus Lumpe

Publication date: 6 June 2013

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2011.10.014

zbMATH Keywords

partition refinementemergent propertiesautomata-based specification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• yEd
• Stata
• Reo
• PICCOLA
• dot

Cites Work

• Interactive Markov chains. And the quest for quantified quality
• A partition refinement algorithm for the \(\pi\)-calculus
• Three Partition Refinement Algorithms
• A Complexity Measure
• The Structure and Function of Complex Networks
• Reo: a channel-based coordination model for component composition
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
• Topological Entropy
• An analysis of variance test for normality (complete samples)
• Frontiers of Combining Systems
• Equilibrium points in n -person games
• Unnamed Item
• Unnamed Item
• 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: Partition refinement of component interaction automata