scientific article

zbMATH Open0765.68147MaRDI QIDQ4037380FDOQ4037380

Antti Valmari

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

reduced state spacesautomatic verification of concurrent systemsstubborn set methodlinear time temporal logic specifications

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (29)

• Partial Order Reduction for State/Event LTL
• Trace consistency and inevitability
• The sweep-line state space exploration method
• Symmetry and partial order reduction techniques in model checking Rebeca
• Partial order reduction for state/event LTL with application to component-interaction automata
• Abstract reduction in directed model checking CCS processes
• \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• A partial order approach to branching time logic model checking.
• Optimising the ProB model checker for B using partial order reduction
• Deciding global partial-order properties
• FDR explorer
• Question-guided stubborn set methods for state properties
• Selective mu-calculus and formula-based equivalence of transition systems
• Title not available (Why is that?)
• Linear temporal logic symbolic model checking
• Automatic verification of reduction techniques in higher order logic
• Experimenting with stubborn sets on Petri nets
• Partial order reduction for rewriting semantics of programming languages
• LTL under reductions with weaker conditions than stutter invariance
• Common knowledge and update in finite environments
• Using heuristic search for finding deadlocks in concurrent systems
• Does My Service Have Partners?
• Compositional reasoning for shared-variable concurrent programs
• A partial order semantics approach to the clock explosion problem of timed automata
• Partial order reduction for checking soundness of time workflow nets
• The inconsistent labelling problem of stutter-preserving partial-order reduction
• Reduced models for efficient CCS verification
• Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic

This page was built for publication:

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