Using partial-order semantics to avoid the state explosion problem in asynchronous systems

DOI10.1007/BFB0023728MaRDI QIDQ4037379zbMATH OpenFDO

Authors David K. Probst, Hon F. Li

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/BFB0023728

zbMATH Keywords

behavior machinesbehavior statesbranching pointdelay-insensitive VLSI systemsmodel checkingpartial-order semanticsrecurrence structurestate explosion

Mathematics Subject Classification ID

Partial orders, general (06A06) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Circuits, networks (94C99)

Recommendations

• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• scientific article; zbMATH DE number 2087625
• Deciding global partial-order properties
• A partial order approach to branching time logic model checking.
• Partial-order reduction in symbolic state-space exploration

Cited in

(3)

• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Automatic verification of distributed systems: the process algebra approach.

This page was built for publication: Using partial-order semantics to avoid the state explosion problem in asynchronous systems

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