We present introductory considerations and analysis toward computing applications based on the recently introduced deterministic logic scheme with random spike (pulse) trains [Phys. Lett. A 373 (2009) 2338–2342]. Also, in considering the questions, “why random?” and “why pulses?”, we show that the random pulse based scheme provides the advantages of realizing multivalued deterministic logic. Pu...

Alloy uses a first-order relational logic for modeling designs. The Alloy Analyzer translates Alloy formulas for a given scope, i.e., a bound on the universe of discourse, to Boolean formulas in conjunctive normal form (CNF), and subsequently checks them using propositional satisfiability solvers. We present SERA, a novel algorithm that compiles a relational logic formula for a given scope to a...

Reactive languages such as Esterel, Lustre, Signal , Statecharts etc have found wide use in the development of veriiable software for reactive applications. It has been recently argued that both asynchrony and perfect synchrony are needed for the speciication of complex reactive systems and a paradigm called Communicating Reactive Processes has been proposed for such a uniication. The paradigm ...

1

Recently, there has been a resurgence of interest in asynchronous design techniques. Asynchronous logic provides a solution to the clock-related timing problems of synchronous systems and can offer higher performance and lower power consumption. This paper presents an approach for modeling and simulating asynchronous computer architectures using occam as a description language.

We present a method which accepts Interval Temporal Logic (ITL) formulas as specication and automatically generates state machines. Since ITL is based on intervals and their sequences, we can easily describe both concurrent and serial behaviors by specifying behaviors inside intervals and sequences among them. ITL formulas are expanded into the ones for the cases that the present state is the n...

We present a logic programming based asynchronous multi-agent system in which agents can communicate with one another; update themselves and each other; abduce hypotheses to explain observations, and use them to generate actions. The knowledge base of the agents is comprised of generalized logic programs, integrity constraints, active rules, and of abducibles. We characterize the interaction am...

In this paper, a new notion of sequential compactness is introduced in L-topological spaces, which is called sequentially S∗-compactness. If L = [0, 1], sequential ultra-compactness, sequential N-compactness and sequential strong compactness imply sequential S∗-compactness, and sequential S∗-compactness implies sequential F-compactness. The intersection of a sequentially S∗-compact L-set and a ...