Networks of Processes with Parameterized State Space

DOI10.1016/S1571-0661(04)00190-2zbMath1262.68103MaRDI QIDQ4921504

Saddek Bensalem, Kai Baukus, Karsten Stahl, Yassine Lakhneche

Publication date: 10 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• PVS
• MONA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning about networks with many identical finite state processes
• An experience in proving regular networks of processes by modular model checking
• Property preserving abstractions for the verification of concurrent systems
• A structural induction theorem for processes
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Reasoning about systems with many processes
• Symbolic model checking with rich assertional languages
• Automatic verification of parameterized networks of processes

This page was built for publication: Networks of Processes with Parameterized State Space