Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Branching-Time Model Checking Gap-Order Constraint Systems

Mayr R., Totzke P.

Fundamenta Informaticae

2016

Vol. 143, nr 3/4

339--353

We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form x−y ≥ k, where x and y are variables or constants and k ∈ N is a non-negative constant. We show that EG model checking is undecidable for GCS, while EF is decidable. In particular, this implies the decidability of strong and weak bisimulation equivalence between GCS and finite-state systems.

Properties of Multiset Language Classes Defined by Multiset Pushdown Automata

Kudlek M., Totzke P., Zetzsche G.

Fundamenta Informaticae

2009

Vol. 93, nr 1-3

235-244

The previously introduced multiset language classes defined by multiset pushdown automata are being explored with respect to their closure properties and alternative characterizations.

Multiset Pushdown Automata

Kudlek M., Totzke P., Zetzsche G.

Fundamenta Informaticae

2009

Vol. 93, nr 1-3

221-233

Multiset finite Automata, a model equivalent to regular commutative grammars, are extended with a multiset store and the accepting power of this extended model of computation is investigated. This type of multiset automata come in two flavours, varying only in the ability of testing the storage for emptiness. This paper establishes normal forms and relates the derived language classes to each other as well as to known multiset language classes.