Forward Analysis for WSTS, Part II: Complete WSTS

DOI10.1007/978-3-642-02930-1_16zbMath1248.68352arXiv1208.4549OpenAlexW2135818959MaRDI QIDQ3638095

Jean Goubault-Larrecq, Alain Finkel

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.4549

Mathematics Subject Classification ID

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

Related Items (12)

Ideal Abstractions for Well-Structured Transition Systems ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Handling infinitely branching well-structured transition systems ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Forward Analysis for WSTS, Part II: Complete WSTS