Efficient computation and representation of large reachability sets for composed automata
type: Item
instance of: scholarly article
title: Efficient computation and representation of large reachability sets for composed automata
zbMATH Open document ID: 1048.93065
DOI: 10.1023/A:1015669415634
author: Peter Buchholz
author: Peter Kemper
published in: Discrete Event Dynamic Systems
publication date: 2002-08-19T00:00:00Z
Mathematics Subject Classification ID: 93C65
Mathematics Subject Classification ID: 93B03
Mathematics Subject Classification ID: 93A15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1783545
zbMATH Keywords: automata networks
zbMATH Keywords: reachability analysis
zbMATH Keywords: Kronecker representation
zbMATH Keywords: ordered natural decision diagrams
MaRDI profile type: Publication
full work available at URL: a:1015669415634
OpenAlex ID: W1505796501
description: scientific article; zbMATH DE number 1783545