scientific article; zbMATH DE number 1759636

zbMATH Open0999.68533MaRDI QIDQ4536629FDOQ4536629

Grégoire Sutre, Purushothaman Iyer, Alain Finkel

Publication date: 2 December 2002

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

Mathematics Subject Classification ID

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

Cited In (9)

• Well-abstracted transition systems: Application to FIFO automata.
• Extensional equivalences for transition systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branch-well-structured transition systems and extensions
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Formalization of Abstract State Transition Systems for SAT
• Abstractions for transition systems with applications to stubborn sets

   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 👍 👎

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)