TCS
2002
13 years 4 months ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
TCS
2002
13 years 4 months ago
2002
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
TCS
2002
13 years 4 months ago
2002
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
TCS
2002
13 years 4 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
oole.stanford.edu/pub/ABSTRACTS Pratt, V.R., "Transition and Cancellation in Concurrency and Branching Time", Math. Structures in Comp. Sci., 13:4, 485-529, August 2003. ...
TCS
2002
13 years 4 months ago
2002
Membrane systems are models of computation which are inspired by some basic features of biological membranes. In a membrane system multisets of objects are placed in the compartme...
TCS
2002
13 years 4 months ago
2002
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...