Forward analysis for WSTS. II: Complete WSTS

DOI10.2168/LMCS-8(3:28)2012MaRDI QIDQ3166218zbMATH OpenOpenAlexFDO

Authors Jean Goubault-Larrecq, Alain Finkel

Publication date 22 October 2012

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-8(3:28)2012

zbMATH Keywords

verificationcovercompletiondcpowell-structured transition systemsclover

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

• Forward Analysis for WSTS, Part II: Complete WSTS
• The Theory of WSTS: The Case of Complete WSTS
• Forward analysis for WSTS. I: Completions
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees

Cited in

(21)

• Forward Analysis for WSTS, Part II: Complete WSTS
• Separability and non-determinizability of WSTS
• Infinitary Noetherian constructions II. Transfinite words and the regular subword topology
• Deciding Structural Liveness of Petri Nets
• The ideal view on Rackoff's coverability technique
• Verification of Flat FIFO Systems
• Forward analysis and model checking for trace bounded WSTS
• The Theory of WSTS: The Case of Complete WSTS
• Coverability trees for Petri nets with unordered data
• Verification of flat FIFO systems
• Forward analysis and model checking for trace bounded WSTS
• Forward analysis for WSTS, part I: completions
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees
• Regular separability of well-structured transition systems
• Bi-reachability in Petri nets with data
• Forward analysis for WSTS. I: Completions
• Commodification of accelerations for the Karp and Miller construction
• Partial-observation stochastic games, how to win when belief fails
• The ideal theory for WSTS
• Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable

This page was built for publication: Forward analysis for WSTS. II: Complete WSTS

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