Network algebra for asynchronous dataflowFootnote^∗

^∗This paper is an abridged version of [1]. The full version covers synchronous dataflow networks as well.

References

• Bergstra , J.A. , Middelburg , C.A. and Ştefänescu , Gh. 1995 . Network algebra for synchronous and asynchronous dataflow , University of Amsterdam . Report P9508 Programming Research Group
   Google Scholar
• C[acaron]z[acaron]nescu , V.E. and Ştefãnescu , Gh. 1990 . Towards a new algebraic foundation of flowchart scheme theory . Fundamenta Informaticae , 13 : 171 – 210 .
   Google Scholar
• Kahn , G. 1974 . “ The semantics of a simple language for parallel processing ” . In Information Processing Edited by: Rosenfeld , J.L. Vol. 74 , 471 – 475 .
   Google Scholar
• Broy , M. 1988 . Nondeterministic dataflow programs: How to avoid the merge anomaly . Science of Computer Programming , 10 : 65 – 85 .
   Google Scholar
• Jonsson , B. 1994 . A fully abstract trace model for dataflow and asynchronous networks . Distributed Computing , 7 : 197 – 212 .
   Google Scholar
• Bergstra , J.A. and Klop , J.W. 1984 . Process algebra for synchronous communication . Information and Control , 60 : 109 – 137 .
   Google Scholar
• Thompson , B.C. and Tucker , J.V. 1991 . Algebraic specification of synchronous concurrent algorithms and architecture , University College of Swansea . Technical Report10-91, Department of Mathematics and Computer Science
   Google Scholar
• Barendregt , H. , Wupper , H. and Mulder , H. 1994 . Computable processes , Catholic University of Nijmegen . Technical Report CSI-R9405, Computing Science Institute
   Google Scholar
• Brock , J.D. and Ackermann , W.B. 1981 . “ Scenarios: A model of non-determinate computation ” . In Formalisation of Programming Concepts , Edited by: Diaz , J. and Riaz , I. Vol. LNCS107 , 252 – 259 . Springer-Verlag .
   Google Scholar
• Russell , J. 1989 . Full abstraction for nondeterministic dataflow networks , IEEE Computer Science Press . In FoCS'89
   Google Scholar
• Ştef[acaron]nescu , Gh. 1990 . Feedback theories(a calculus for isomorphism classes of flowchart schemes) . Revue Roumaine de Mathematiques Pures et Applique , 35 : 73 – 79 .
   Google Scholar
• Böhm , A.P.W. 1984 . “ Dataflow Computation. CWI Tracts 6 ” . In Centre for Mathematics and Computer Science Amsterdam
   Google Scholar
• Kok , J. 1987 . A fully abstract semantics for data flow nets , Edited by: de Bakker , J.W. , Nijman , A.J. and Treleaven , P.C. Vol. LNCS 259 , 351 – 368 . Springer-Verlag . PARLE'87
   Google Scholar
• Van Glabbeek , R.J. , Weijland , W.P. and Ritter , G.X. 1989 . Information Processing 89 , 613 – 618 . CWI : North-Holland . Full version: Report CS-9120
   Google Scholar
• Baeten , J.C.M. and Weijland , W.P. 1990 . Process Algebra , Vol. 18 , Cambridge University Press . Cambridge Tracts in Theoretical Computer Science
   Google Scholar
• Baeten , J.C.M. and Bergstra , J.A. 1988 . Global renaming operators in concrete process algebra . Information and Control , 78 : 205 – 245 .
   Google Scholar
• Baeten , J.C.M. and Bergstra , J.A. 1992 . “ Process algebra with signals and conditions ” . In Programming and Mathematical Methods , F88 273 – 323 . Springer-Verlag .
   Google Scholar
• Bergstra , J.A. , Bethke , I. and Ponse , A. 1994 . Process algebra with iteration . The Computer Journal , 37 : 243 – 258 .
   Web of Science ®Google Scholar
• Baeten , J.C.M. and Bergstra , J.A. 1994 . On sequential composition, action prefixes and process prefix . Formal Aspects of Computing , 6 : 250 – 258 .
   Google Scholar
• Ştef[acaron]nescu , Gh. 1987 . On flowchart theories: Part II. The nondeterministic case . Theoretical Computer Science , 52 : 307 – 340 .
   Google Scholar
• Baeten , J.C.M. and Bergstra , J.A. 1995 . “ Discrete time process algebra with abstraction ” . In Fundamentals of Computation Theory , Edited by: Reichel , H. Vol. LNCS 965 , 1 – 15 . Springer-Verlag .
   Google Scholar
• Ştef[acaron]nescu , G.H. 1994 . “ Algebra of flownomials ” . In Part 1: Binary flownomials, basic theory , Technical University Munich . Technical Report 19437, Department of Computer Science
   Google Scholar
• Van Glabbeek , R.J. and Vaandrager , F.W. 1993 . Modular specification of process algebras . Theoretical Computer Science , 113 : 293 – 348 .
   Google Scholar
• Groote , J.F. and Korver , H.P. 1995 . “ A correctness proof of the bakery protocol in μCRL ” . In Algebra of Communicating Processes 1994 , Edited by: Ponse , A. , Verhoef , C. and van Vlijmen , S.F.M. 63 – 86 . Springer-Verlag . Workshop in Computing Series
   Google Scholar
• Korver , H. and Springintveld , J. 1994 . A computer- checked verification of Milner's scheduler , Edited by: Hagiya , M. and Mitchell , J. 161 – 178 . Springer-Verlag . TACS'94, LNCS 789
   Google Scholar
• Groote , J.F. and Ponse , A. 1994 . “ Proof theory for mCRL: A language for processes with data ” . In Semantics of Specification Language , Edited by: Andrews , D.J. , Groote , J.F. and Middelburg , C.A. 232 – 251 . Springer-Verlag . Workshop in Computing Series
   Google Scholar
• Baeten , J.C.M. , Bergstra , J.A. and Klop , J.W. 1987 . “ Conditional axioms and α/β- calculus in process algebra ” . In Formal Description of Programming Concepts III , Edited by: Wirsing , M. 53 – 75 . North-Holland .
   Google Scholar
• Dowek , G. , Felty , A. , Herbelin , H. , Huet , G.P. , Murthy , C. , Parent , C. , Paulin-Mohring , C. and Werner , B. 1993 . The Coq proof assistant user's guide, version 5.8 , INRIA- Rocquencourt . Technical report
   Google Scholar
• Keller , R.M. and Neuhold , E. 1978 . “ Denotational models for parallel programs with nondeterminate operators ” . In Formal Description of Programming Concepts , 337 – 366 . North-Holland .
   Google Scholar
• Bergstra , J.A. , Klop , J.W. and Olderog , E. 1987 . “ Failures without chaos: A new process semantics for fair abstraction ” . In Formal Description ofProgramming Concepts III , Edited by: Wirsing , M. 77 – 103 . North-Holland .
   Google Scholar
• Van Glabbeek , R.J. 1987 . Bounded nondetermmism and the approximation induction principle in process algebra , Edited by: Brandenburg , F.J. , Vidal-Naquet , G. and Wirsing , M. 336 – 347 . Springer-Verlag . STACS 87, LNCS 247
   Google Scholar
• Bergstra , J.A. and Klop , J.W. 1985 . Algebra of communicating processes with abstraction . Theoretical Computer Science , 37 : 77 – 121 .
   Web of Science ®Google Scholar
• Bezem , M.A. and Groote , J.F. 1994 . Invariants in process algebra with data , Edited by: Jonsson , B. and Parrow , J. 401 – 416 . Springer-Verlag . CONCUR′94, LNCS 836
   Google Scholar
• Groote J. F. Springintveld J. Focus points and convergent process operators Logic Group Prepring Series 142 Utrecht University, Department of Philosophy 1995
   Google Scholar
• Broy , M. 1993 . Functional specification of time sensitive communicating systems . ACM Transactions on Software Engineering and Methodology , 2 : 1 – 46 .
   Google Scholar
• Parrow , J. 1985 . Fairness Properties in Process Algebra with Applications in Communication Protocol Verification , Uppsala University . PhD thesis, Department of Computer Science
   Google Scholar