Verification of well-formed communicating recursive state machines
type: Item
instance of: scholarly article
title: Verification of well-formed communicating recursive state machines
zbMATH Open document ID: 1154.68078
author: Laura Bozzelli
author: Salvatore La Torre
author: Adriano Peron
published in: Theoretical Computer Science
publication date: 2008-09-16T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N19
zbMATH DE Number: 5344356
zbMATH Keywords: infinite-state systems
zbMATH Keywords: pushdown systems
zbMATH Keywords: formal models of concurrency and recursion
zbMATH Keywords: model checking
zbMATH Keywords: linear-time logics
zbMATH Keywords: context-free specifications
zbMATH Keywords: tree automata
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.06.012
OpenAlex ID: W4248796439
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Process Algebra
cites work: Constrained properties, semilinear systems, and Petri nets
cites work: A generic approach to the static analysis of concurrent programs with procedures
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Reachability analysis of synchronized PA systems
cites work: CONCUR 2005 – Concurrency Theory
cites work: Tree generating regular systems
cites work: Q3979263
cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
cites work: Q4858945
cites work: Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
cites work: Model checking LTL with regular valuations for pushdown systems
cites work: Statecharts: a visual formalism for complex systems
cites work: On the analysis of interacting pushdown systems
cites work: Context-Bounded Analysis of Concurrent Queue Systems
cites work: Q4234763
cites work: Process rewrite systems.
cites work: Q5590814
cites work: Q4385530
cites work: Fair termination is decidable for ground systems
cites work: Automata-theoretic techniques for modal logics of programs
DOI: 10.1016/J.TCS.2008.06.012
Recommended article: Verification, Model Checking, and Abstract Interpretation
Recommended article: Verification of finite-state machines: a distributed approach
Recommended article: Q4818811
Recommended article: Q4494394
Recommended article: Tools and Algorithms for the Construction and Analysis of Systems
Recommended article: Q4520893
Recommended article: Verification of scope-dependent hierarchical state machines
Recommended article: Parameterized Verification of Communicating Automata under Context Bounds
Recommended article: Q4413690
Recommended article: Q4934532
description: scientific article; zbMATH DE number 5344356