Unfolding Concurrent Well-Structured Transition Systems

DOI10.1007/978-3-540-71209-1_55MaRDI QIDQ5758140zbMATH OpenOpenAlexFDO

Authors Frédéric Herbreteau, Grégoire Sutre, T. Q. Tran

Publication date 3 September 2007

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71209-1_55

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• scientific article; zbMATH DE number 1059333
• scientific article; zbMATH DE number 1670797
• scientific article; zbMATH DE number 2086795
• scientific article; zbMATH DE number 177254

Cited in

(9)

• scientific article; zbMATH DE number 2086795 (Why is no real title available?)
• scientific article; zbMATH DE number 6790161 (Why is no real title available?)
• scientific article; zbMATH DE number 5068370 (Why is no real title available?)
• Attributed transition systems with hidden transitions
• Branch-well-structured transition systems and extensions
• Well-structured transition systems everywhere!
• Taking complete finite prefixes to high level, symbolically
• Well structured transition systems with history
• Taking complete finite prefixes to high level, symbolically

This page was built for publication: Unfolding Concurrent Well-Structured Transition Systems

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