Abstract

. We introduce frames as basic objects for the construction of transition systems, process graphs or automata. We provide an algebraic notation for frames, and display some theoretical results. Key words & Phrases: Frame, Process, Decidability. 1987 CR Categories: F.1.1, F.4.3, I.1.1. 1 Introduction In this paper we propose a very simple, mathematical structure which we think to be of the type that underlies many structures modelling (concurrent) behaviour. The objects in this structure are called frames. We provide an axiomatic, algebraic approach to reasoning about equality between frames. Frames can be characterized as a particular kind of graphs; in fact, all frames in the present paper are labeled, directed graphs. The axioms however will allow other models. The main source of such models is the introduction of various degrees of locality (invisibility, hiding) for states. If no hiding mechanism on states is present, all states are called sharp. In this paper we will restrict a...

Citations