Partition refinement of component interaction automata
type: Item
instance of: scholarly article
title: Partition refinement of component interaction automata
zbMATH Open document ID: 1264.68060
author: Markus Lumpe
published in: Science of Computer Programming
publication date: 2013-06-06T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6171349
zbMATH Keywords: automata-based specification
zbMATH Keywords: partition refinement
zbMATH Keywords: emergent properties
describes a project that uses: Reo
describes a project that uses: PICCOLA
describes a project that uses: yEd
describes a project that uses: Stata
describes a project that uses: dot
MaRDI profile type: Publication
full work available at URL: j.scico.2011.10.014
OpenAlex ID: W2046349244
cites work: Q4417622
cites work: Q4331846
cites work: Q4439564
cites work: Q4473726
cites work: Q4506483
cites work: Interactive Markov chains. And the quest for quantified quality
cites work: A partition refinement algorithm for the \(\pi\)-calculus
cites work: The Structure and Function of Complex Networks
cites work: Q3992568
cites work: Reo: a channel-based coordination model for component composition
cites work: Frontiers of Combining Systems
cites work: Q4804914
cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
cites work: Three Partition Refinement Algorithms
cites work: Q3907077
cites work: Q4355684
cites work: Q4777516
cites work: Topological Entropy
cites work: An analysis of variance test for normality (complete samples)
cites work: Q3837262
cites work: Q3150769
cites work: Equilibrium points in n -person games
cites work: A Complexity Measure
DOI: 10.1016/J.SCICO.2011.10.014
description: scientific article; zbMATH DE number 6171349