author={Seymour Ginsburg and Edwin H. Spanier},
  journal={Transactions of the American Mathematical Society},
  • S. GinsburgE. Spanier
  • Published 1 November 1964
  • Computer Science
  • Transactions of the American Mathematical Society

Forward Analysis and Model Checking for Bounded WSTS

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

Non-closure under complementation for unambiguous linear grammars

It is proved that the complement of this language is not defined by any context-free grammar, which constitutes an alternative proof for the result of Hibbard and Ullian on the non-closure of the unambiguous languages under complementation.

Computer Synthesizing Self-Stabilizing Parameterized Protocols with Unbounded Variables

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

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

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

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.

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

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

Petri Net Reachability Graphs: Decidability Status of First Order Properties

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



Note on the Boolean Properties of Context Free Languages

Elementary properties of ordered abelian groups

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

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

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

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

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.

On Certain Formal Properties of Grammars

Finite Automata and Their Decision Problems

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.