## 257 Citations

### Forward Analysis and Model Checking for Bounded WSTS

- Computer ScienceArXiv
- 2010

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…

### Computer Synthesizing Self-Stabilizing Parameterized Protocols with Unbounded Variables

- Computer Science, Mathematics
- 2022

This work synthesizes some self-stabilizing unbounded protocols, including a near agreement and a parity protocol, and characterize the unbounded nature of protocols as semilinear sets, and show that such characterization simplifies synthesis.

### Enumerating Projections of Integer Points in Unbounded Polyhedra

- MathematicsSIAM J. Discret. Math.
- 2018

The Barvinok--Woods algorithm for enumerating projections of integer points in polytopes to unbounded polyhedra is extended and a new structural result on projections of semilinear s... is obtained.

### Bounded underapproximations

- Computer Science, MathematicsFormal Methods Syst. Des.
- 2012

It is shown that verification with bounded languages generalizes context-bounded reachability for multithreaded programs and to underapproximate the reachable state space of recursive counter programs.

### Forward analysis and model checking for trace bounded WSTS

- Computer ScienceTheor. Comput. Sci.
- 2016

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…

### Hierarchy of persistence with respect to the length of action's disability.

- Philosophy, Computer Science
- 2015

It is proved that if an action is disabled, and not killed, by another one, it can not be postponed indefinitely, and all the kinds of e/l-k persistencies are decidable with respect to steps, markings and nets.

### Logic and Branching Automata

- Mathematics, Computer Science
- 2015

This paper proves that the class of languages of finite N-free posets recognized by branching automata is closed under complementation, and defines a logic, named P-MSO, as it is a extension of monadic second-order logic with Presburger arithmetic, and shows that it is precisely as expressive as branching Automata.

### The dissecting power of regular languages

- Computer ScienceInf. Process. Lett.
- 2013

### Petri Net Reachability Graphs: Decidability Status of First Order Properties

- Computer ScienceLog. Methods Comput. Sci.
- 2012

We investigate the decidability and complexity status of model-checking prob- lems on unlabelled reachability graphs of Petri nets by considering first-order and modal languages without labels on…

### Bounded Parikh Automata

- Computer ScienceInt. J. Found. Comput. Sci.
- 2012

Some expressiveness properties of a restriction of the deterministic affine PA recently introduced are presented, and they are used as a tool to show that the bounded languages recognized by PA are the same as those recognized by deterministic PA.

## References

SHOWING 1-10 OF 10 REFERENCES

### Note on the Boolean Properties of Context Free Languages

- Computer Science, LinguisticsInf. Control.
- 1960

### Elementary properties of ordered abelian groups

- Mathematics
- 1960

Introduction. A complete classification of abelian groups by their elementary properties (i.e. properties that can be formalized in the lower predicate calculus) was given by Szmielew [9]. No such…

### Two Families of Languages Related to ALGOL

- Computer ScienceJACM
- 1962

The purpose of this investigation is to gain some insight into the syntax of POL, in particular ALGOL, and finds that the defining scheme for ALOOL turns out to be equivalent to one of the several schemes described by Chomsky in his attempt to analyze the morphology of natural languages.

### Operations Which Preserve Definability in Languages

- Computer ScienceJACM
- 1963

A large number of specific operations-many occurring in data processing--arc shown to preserve definability and, depending on the operation, sequential definability.

### Some Recursively Unsolvable Problems in ALGOL-Like Languages

- Computer ScienceJACM
- 1963

It is proved that two "natural" questions about definable and sequentially definable sets are recursively unsolvable, that is, there are no algorithms for deciding the answers to these questions.

### Three models for the description of language

- LinguisticsIRE Trans. Inf. Theory
- 1956

It is found that no finite-state Markov process that produces symbols with transition from state to state can serve as an English grammar, and the particular subclass of such processes that produce n -order statistical approximations to English do not come closer, with increasing n, to matching the output of anEnglish grammar.

### Finite Automata and Their Decision Problems

- Computer ScienceIBM J. Res. Dev.
- 1959

Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.