Empty interworkings and refinement semantics of interworkings revised

The semantics for Interworkings from [MvWW93] does not give a proper meaning to empty entities and empty Interworkings. Furthermore, the process algebra considered has to be extended in order to define refinement of Interworkings. For these purposes we give a revision and extension of the semantics.

[1]  L. D. J. C. Loyens,et al.  ILIAS : a sequential language for parallel matrix computations , 1993 .

[2]  M. van Wijk,et al.  A formal semantics of synchronous interworkings , 1993 .

[3]  J. P. Veltkamp,et al.  On the unavoidability of metastable behaviour , 1993 .

[4]  Lex Bijlsma,et al.  Temporal operators viewed as predicate transformers , 1993 .

[5]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part V. Specification language , 1993 .

[6]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part IV. Analysis methods , 1993 .

[7]  Jan A. Bergstra,et al.  Process Algebra with Partial Choice , 1994, CONCUR.

[8]  A.V. Kovalyov.  An O , 1995, Proceedings of Tenth International Symposium on Intelligent Control.

[9]  Ehl Emile Aarts,et al.  A quantitative analysis of iterated local research , 1995 .

[10]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part II. Frameworks , 1993 .

[11]  Amir Pnueli,et al.  Verifying sequentially consistent memory , 1994 .

[12]  Jan A. Bergstra,et al.  Global Renaming Operators in Concrete Process Algebra , 1988, Inf. Comput..

[13]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[14]  Herman Geuvers,et al.  A short and flexible proof of Strong Normalization for the Calculus of Constructions , 1994, TYPES.

[15]  B. Watson.  A taxonomy of finite automata minimization algorithms , 1993 .

[16]  R. Backhouse,et al.  Mathematical induction made calculational , 1994 .

[17]  Jan A. Bergstra,et al.  The Algebra of Recursively Defined Processes and the Algebra of Regular Processes , 1984, ICALP.

[18]  Michel A. Reniers,et al.  An Algebraic Semantics of Basic Message Sequence Charts , 1994, Comput. J..

[19]  H.P.J. van Geldrop van Eijk.  Deriving the Aho-Corasick algorithms : a case study into the synergy of programming methods , 1993 .

[20]  C. W. A. M. van Overveld,et al.  Stars or Stripes: a comparative study of finite and transfinite techniques for surface modelling , 1994 .

[21]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[22]  Ron Selj.  A New Method for Integrity Constraint Checking in Deductive Databases , 1994 .

[23]  Chenho Kung,et al.  The Object-oriented Paradigm , 1991 .

[24]  Jpc Jack Verhoosel.  A formal deterministic scheduling model for hard real-time executings in DEDOS , 1993 .

[25]  Roland Carl Backhouse,et al.  Category theory as coherently constructive lattice theory : an illustration , 1994 .

[26]  Jan A. Bergstra,et al.  Process Algebra with Propositional Signals , 1994, Theor. Comput. Sci..

[27]  R. R. Seljée,et al.  Deductive Database Systems and integrity constraint checking , 1995 .

[28]  Cj Roel Bloo,et al.  Preservation of strong normalisation for explicit substitution , 1995 .

[29]  Paula Severi,et al.  A Type Inference Algorithm for Pure Type Systems , 1995 .

[30]  Gjpm Geert-Jan Houben.  Tutorial voor de ExSpect-bibliotheek voor "administratieve logistiek" , 1994 .

[31]  Jan Peleska,et al.  A comparison of Ward & Mellor's transformation schema with state & activitycharts , 1994 .

[32]  van Hpj Rik Geldrop.  Deriving the Aho-Corasick algorithms : a case study into the synergy of programming methods , 1993 .

[33]  Fairouz Kamareddine,et al.  Refining Reduction in the Lambda Calculus , 1995, J. Funct. Program..

[34]  J. R. van den Brink,et al.  Formal Semantics of Interworkings with Discrete Absolute Time , 1995 .

[35]  Aart Blokhuis,et al.  On the Equivalence Covering Number of Splitgraphs , 1995, Inf. Process. Lett..

[36]  Chris Verhoef,et al.  Concrete process algebra , 1995, LICS 1995.

[37]  Dieter Kratsch,et al.  Listing simplicial vertices and recognizing diamond-free graphs , 1994 .

[38]  Bill Roscoe,et al.  An Operational Semantics for CSP , 1986 .

[39]  Arend Rensink,et al.  Weak Sequential Composition in Process Algebras , 1994, CONCUR.

[40]  Jan A. Bergstra,et al.  Graph isomorphism models for non interleaving process algebra , 1994 .

[41]  Jos C. M. Baeten,et al.  Delayed choice: an operator for joining Message Sequence Charts , 1994, FORTE.

[42]  T Tom Verhoeff,et al.  A continuous version of the prisoner's dilemma , 1993 .

[43]  B. Watson.  A taxonomy of finite automata construction algorithms , 1993 .

[44]  ten Hmm Huub Eikelder,et al.  On the correctness of some algorithms to generate finite automata for regular expressions , 1993 .

[45]  Jeremy P. Spinrad,et al.  Treewidth and pathwidth of cocomparability graphs of bounded dimension , 1993 .

[46]  Jan Korst,et al.  Deterministic and randomized local search , 1993 .

[47]  Rr Rob Hoogerwoord,et al.  On the foundations of functional programming : a programmer's point of view , 1994 .

[48]  Dennis Taylor,et al.  Time and order of abstract events in distributed computations , 1994 .

[49]  Ajh Jan Hidders,et al.  An isotopic invariant for planar drawings of connected planar graphs , 1995 .

[50]  Erik J. Luit,et al.  A precise clock synchronization protocol , 1993 .

[51]  Roland Carl Backhouse,et al.  Fixed-Point Calculus , 1995, Inf. Process. Lett..

[52]  Bruce W. Watson.  An introduction to the FIRE engine : a C++ toolkit for finite automata and regular expressions , 1994 .

[53]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[54]  Jj Vereijken,et al.  Fischer's protocol in timed process algebra , 1994 .

[55]  van Os Onno Roosmalen,et al.  A hierarchical diagrammatic representation of class structure , 1994 .

[56]  Rp Rob Nederpelt,et al.  On Pi-conversion in type theory , 1994 .

[57]  Rt Rob Gerth.  Verifying sequentially consistent memory using interface refinement , 1993 .

[58]  Bruce W. Watson,et al.  The performance of single-keyword and multiple-keyword pattern matching algorithms , 1994 .