We investigate a subclass of well-structured transition systems (WSTS), the bounded—in the sense of Ginsburg and Spanier (Trans. AMS 1964)— complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (ICALP 2009b). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, bounded-ness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all ω-regular properties on the set of infinite traces of the system.
AbstractCoordination models and languages are introduced to effectively rule and govern the interact...
International audienceExplicit behavioural interfaces are now accepted as a mandatory feature of com...
Journal version of https://hal.inria.fr/hal-01176755International audienceWell-structured transition...
We describe a simple, conceptual forward analysis procedure forinfinity-complete WSTS S. This comput...
Well-structured transition systems provide the right foundation to compute a finite basis of the set...
The well-quasi-ordering (i.e., a well-founded quasi-ordering such that allantichains are finite) tha...
International audienceWell-structured transition systems provide the right foundation to compute a f...
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interest...
AbstractWell-structured transition systems (WSTSs) are a general class of infinite-state systems for...
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interest...
Abstract. Well-structured transition systems (WSTS) are a broad and well-studied class of infinite-s...
none1noCoordination models and languages are introduced to effectively rule and govern the interacti...
Well-structured pushdown systems (WSPDSs) extend pushdown systems with well-quasi-ordered (possibly ...
Abstract. Well-structured systems, aka WSTSs, are computational models where the set of possible con...
There is a recent separability result for the languages of well-structured transition systems (WSTS)...
AbstractCoordination models and languages are introduced to effectively rule and govern the interact...
International audienceExplicit behavioural interfaces are now accepted as a mandatory feature of com...
Journal version of https://hal.inria.fr/hal-01176755International audienceWell-structured transition...
We describe a simple, conceptual forward analysis procedure forinfinity-complete WSTS S. This comput...
Well-structured transition systems provide the right foundation to compute a finite basis of the set...
The well-quasi-ordering (i.e., a well-founded quasi-ordering such that allantichains are finite) tha...
International audienceWell-structured transition systems provide the right foundation to compute a f...
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interest...
AbstractWell-structured transition systems (WSTSs) are a general class of infinite-state systems for...
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interest...
Abstract. Well-structured transition systems (WSTS) are a broad and well-studied class of infinite-s...
none1noCoordination models and languages are introduced to effectively rule and govern the interacti...
Well-structured pushdown systems (WSPDSs) extend pushdown systems with well-quasi-ordered (possibly ...
Abstract. Well-structured systems, aka WSTSs, are computational models where the set of possible con...
There is a recent separability result for the languages of well-structured transition systems (WSTS)...
AbstractCoordination models and languages are introduced to effectively rule and govern the interact...
International audienceExplicit behavioural interfaces are now accepted as a mandatory feature of com...
Journal version of https://hal.inria.fr/hal-01176755International audienceWell-structured transition...