A State Transformation Equivalence for Concurrent Systems: Exhibited Functionality-equivalence

Most of the equivalence notions for concurrent systems proposed in recent years are defined in terms of sequences (posets) of observable actions, and therefore they are not suitable for comparing two systems whose actions are defined at different levels of detail. In this paper a new equivalence notion for concurrent systems (more precisely for contact-free S-labelled EN systems) is introduced: namely Exhibited Functionality- (EF-) equivalence. EF-equivalence is defined in terms of observable global states transformations. Its main characteristics is that it takes into account the structure of the global states of the system in terms of the local states of its components, so that it characterizes the locality of any state trasformation performed by the system components. Each EF-equivalence class of contact-free S-observable EN systems, a subclass of S-labelled EN systems, is shown to contain one and only one simple and pure contact-free EN system.

[1]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[2]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[3]  Giorgio De Michelis,et al.  Exhibited-Behaviour Equivalence and Organizational Abstraction in Concurrent System Design , 1985, ICDCS.

[4]  Grzegorz Rozenberg,et al.  Current Trends in Concurrency , 1986, Lecture Notes in Computer Science.

[5]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[6]  Grzegorz Rozenberg,et al.  Petri Nets: Basic Notions, Structure, Behaviour , 1986, Current Trends in Concurrency.

[7]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[8]  K. Voss,et al.  Interface as a basic concept for systems specification and verification , 1987 .

[9]  Grzegorz Rozenberg,et al.  Concurrency and Nets , 1987, Springer Berlin Heidelberg.

[10]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985 , 1985, Lecture Notes in Computer Science.

[11]  P. S. Thiagarajan,et al.  Elementary Net Systems , 1986, Advances in Petri Nets.

[12]  Gérard Berthelot,et al.  Transformations and Decompositions of Nets , 1986, Advances in Petri Nets.