Open AccessElementary Transition Systems and Refinement
Author(s) -
Mogens Nielsen,
Grzegorz Rozenberg,
P. S. Thiagarajan
Publication year - 1991
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v20i346.6576
Subject(s) - principle of compositionality , computer science , concurrency , simple (philosophy) , substitution (logic) , morphism , transition system , abstraction , projection (relational algebra) , causality (physics) , embedding , event (particle physics) , theoretical computer science , programming language , mathematics , discrete mathematics , algorithm , artificial intelligence , philosophy , physics , epistemology , quantum mechanics
The model of Elementary Transition Systems has been introduced by the authors as an abstraction of Elementary Net Systems - with a formal embedding in terms of a categorical coreflection, keeping behavioural information like causality, concurrency and conflict, but forgetting the concrete programming of a particular behaviour over an event set using conditions. In this paper we give one example of the advantages of ETS over ENS, - the definition of local state refinement. We show that the well known problems in understanding within nets the simple notion of syntactic substitution of conditions by (sub) nets behaviourally, - these problems seem to disappear when moving to the more abstract level of ETS. Formally, we show that the ETS-version of condition-substitution does satisfy nice and natural properties, e.g., projection and compositionality results w.r.t. a standard notion of transition system morphisms.