Skip to main navigation Skip to search Skip to main content

Partial-order reduction in the weak modal mu-calculus

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

27 Scopus citations

Abstract

We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concurrency Factory specification and verification environment; experimental results show that partial-order reduction can be highly effective in combating state explosion in modal mu-calculus model checking.

Original languageEnglish
Title of host publicationCONCUR 1997
Subtitle of host publicationConcurrency Theory - 8th International Conference, Proceedings
EditorsAntoni Mazurkiewicz, Józef Winkowski
PublisherSpringer Verlag
Pages5-24
Number of pages20
ISBN (Print)3540631410, 9783540631415
DOIs
StatePublished - 1997
Event8th International Conference on Concurrency Theory, CONCUR 1997 - Warsaw, Poland
Duration: Jul 1 1997Jul 4 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1243
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Concurrency Theory, CONCUR 1997
Country/TerritoryPoland
CityWarsaw
Period07/1/9707/4/97

Fingerprint

Dive into the research topics of 'Partial-order reduction in the weak modal mu-calculus'. Together they form a unique fingerprint.

Cite this