Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
type: Item
instance of: scholarly article
title: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
zbMATH Open document ID: 0933.68089
DOI: 10.1016/S0304-3975(99)00033-X
author: Ahmed Bouajjani
author: Peter Habermehl
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1387427
zbMATH Keywords: verification
zbMATH Keywords: infinite-state systems
zbMATH Keywords: FIFO-channel systems
zbMATH Keywords: symbolic reachability analysis
zbMATH Keywords: non-regular sets
zbMATH Keywords: automata
zbMATH Keywords: linear constraints
MaRDI profile type: Publication
cites work: Verifying programs with unreliable channels
cites work: The algorithmic analysis of hybrid systems
cites work: A theory of timed automata
cites work: Reachability analysis of pushdown automata: Application to model-checking
cites work: On Communicating Finite-State Machines
cites work: Q4222871
cites work: Unreliable channels are easier to verify than perfect channels
cites work: Q4223067
cites work: Testing for unboundedness of fifo channels
description: scientific article; zbMATH DE number 1387427