Projecting transition systems: overcoming state explosion in concurrent system verification

DOI10.1134/S0361768815060043MaRDI QIDQ300375zbMATH OpenFDO

Authors A. S. Kamkin

Publication date 27 June 2016

Published in Programming and Computer Software (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)

Recommendations

• Automatic verification of concurrent systems using a formula-based compositional approach
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• scientific article; zbMATH DE number 2086795
• Model Checking – My 27-Year Quest to Overcome the State Explosion Problem
• Distributed partial order reduction of state spaces

Cites work

• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• scientific article; zbMATH DE number 4180789 (Why is no real title available?)
• scientific article; zbMATH DE number 42303 (Why is no real title available?)
• scientific article; zbMATH DE number 3397217 (Why is no real title available?)
• Irredundant algorithms for traversing directed graphs: The deterministic case
• Irredundant algorithms for traversing directed graphs: the nondeterministic case
• Mathematical modelling. Ideas. Methods. Examples
• Model-based testing of reactive systems. Advanced lectures.

Cited in

(1)

• Reordering control approaches to state explosion in model checking with memory consistency models

Describes a project that uses

Uses Software

• CTESK
• UniTESK
• SMV
• SPIN

This page was built for publication: Projecting transition systems: overcoming state explosion in concurrent system verification

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