Sciweavers

MFCS
1998
Springer
13 years 8 months ago
One Guess One-Way Cellular Arrays
One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a lim...
Thomas Buchholz, Andreas Klein, Martin Kutrib
MFCS
1998
Springer
13 years 8 months ago
Deadlocking States in Context-Free Process Algebra
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
Jirí Srba
MFCS
1998
Springer
13 years 8 months ago
Blockwise Variable Orderings for Shared BDDs
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
Harry Preuß, Anand Srivastav
MFCS
1998
Springer
13 years 8 months ago
Flow Logic for Imperative Objects
We develop a control flow analysis for the Imperative Object Calculus. We prove the correctness with respect to two Structural Operational Semantics that differ in minor technical ...
Flemming Nielson, Hanne Riis Nielson
MFCS
1998
Springer
13 years 8 months ago
Timed Bisimulation and Open Maps
Thomas Hune, Mogens Nielsen
MFCS
1998
Springer
13 years 8 months ago
Spatial and Temporal Refinement of Typed Graph Transformation Systems
Martin Große-Rhode, Francesco Parisi-Presicc...
MFCS
1998
Springer
13 years 8 months ago
Tally NP Sets and Easy Census Functions
Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
MFCS
1998
Springer
13 years 8 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire