scientific article; zbMATH DE number 1701768

MaRDI QIDQ2769596zbMATH OpenFDO

Authors Gianfranco Ciardo, Gerald Lüttgen, Radu I. Siminiceanu

Publication date 5 February 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2031/20310328

Mathematics Subject Classification ID

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

Recommendations

• Exploiting interleaving semantics in symbolic state-space generation
• Symbolic Methods for the State Space Exploration of GSPN Models
• Partial-order reduction in symbolic state-space exploration
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Correct Hardware Design and Verification Methods
• Correct Hardware Design and Verification Methods
• Symbolic state-space exploration and numerical analysis of state-sharing composed models
• scientific article; zbMATH DE number 1696452

Cited in

(21)

• Correct Hardware Design and Verification Methods
• scientific article; zbMATH DE number 1696452 (Why is no real title available?)
• Saturation Enhanced with Conditional Locality: Application to Petri Nets
• Measuring and evaluating parallel state-space exploration algorithms
• Computing bottom SCCs symbolically using transition guided reduction
• Improving Saturation Efficiency with Implicit Relations
• Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
• Exploiting interleaving semantics in symbolic state-space generation
• Symbolic CTL model checking of asynchronous systems using constrained saturation
• A CTL* Model Checker for Petri Nets
• Symbolic Reachability Analysis of Integer Timed Petri Nets
• scientific article; zbMATH DE number 1956594 (Why is no real title available?)
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
• A pattern recognition approach for speculative firing prediction in distributed saturation state-space generation
• New search strategies for the Petri net CEGAR approach
• Symbolic termination and confluence checking for ECA rules
• A decision diagram operation for reachability
• Component-wise incremental LTL model checking
• Symbolic state-space exploration and numerical analysis of state-sharing composed models
• Symbolic synthesis of masking fault-tolerant distributed programs

Describes a project that uses

Uses Software

• SPIN
• SMART_

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 Q2769596)