Verifying universal properties of parameterized networks

DOI10.1007/3-540-45352-0_24MaRDI QIDQ2766662zbMATH OpenFDO

Authors Kai Baukus, Karsten Stahl, Yassine Lakhnech

Publication date 13 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45352-0_24

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)

Recommendations

• Verification of parameterized protocols
• Abstracting WS1S systems to verify parameterized networks
• scientific article; zbMATH DE number 1232244
• Networks of processes with parameterized state space
• Automatic verification of parameterized networks of processes

Cited in

(7)

• Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
• Verification of parameterized protocols
• scientific article; zbMATH DE number 1232244 (Why is no real title available?)
• Abstracting WS1S systems to verify parameterized networks
• Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
• Networks of processes with parameterized state space
• Automatic verification of parameterized networks of processes

This page was built for publication: Verifying universal properties of parameterized networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766662)