scientific article; zbMATH DE number 1759636

MaRDI QIDQ4536629zbMATHFDO

Authors Purushothaman Iyer, Grégoire Sutre, Alain Finkel

Publication date 2 December 2002

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Well-abstracted transition systems: Application to FIFO automata.
• Systematic Acceleration in Regular Model Checking
• On (omega-)regular model checking
• Automated Technology for Verification and Analysis
• Automated Technology for Verification and Analysis

Cited in

(10)

• Branch-well-structured transition systems and extensions
• Well-abstracted transition systems: Application to FIFO automata.
• Formalization of Abstract State Transition Systems for SAT
• scientific article; zbMATH DE number 6790161 (Why is no real title available?)
• scientific article; zbMATH DE number 5068370 (Why is no real title available?)
• Automated Technology for Verification and Analysis
• Extensional equivalences for transition systems
• scientific article; zbMATH DE number 1954380 (Why is no real title available?)
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Abstractions for transition systems with applications to stubborn sets

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