Projecting transition systems: overcoming state explosion in concurrent system verification

DOI10.1134/S0361768815060043zbMATH Open1339.68189MaRDI QIDQ300375FDOQ300375

Authors: A. S. Kamkin 

Publication date: 27 June 2016

Published in: Programming and Computer Software (Search for Journal in Brave)

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Model-based testing of reactive systems. Advanced lectures.
• Irredundant algorithms for traversing directed graphs: The deterministic case
• Mathematical modelling. Ideas. Methods. Examples
• Title not available (Why is that?)
• Title not available (Why is that?)
• Irredundant algorithms for traversing directed graphs: the nondeterministic case

Cited In (1)

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

Uses Software

• SPIN
• SMV
• UniTESK
• CTESK

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)