AAAAAA

   
Results: 1-17 |
Results: 17
THE DISCRETE-TIME TOOLBUS - A SOFTWARE COORDINATION ARCHITECTURE
Authors: BERGSTRA JA KLINT P
Citation: Ja. Bergstra et P. Klint, THE DISCRETE-TIME TOOLBUS - A SOFTWARE COORDINATION ARCHITECTURE, Science of computer programming, 31(2-3), 1998, pp. 205-229
KLEENES 3-VALUED LOGIC AND PROCESS ALGEBRA
Authors: BERGSTRA JA PONSE A
Citation: Ja. Bergstra et A. Ponse, KLEENES 3-VALUED LOGIC AND PROCESS ALGEBRA, Information processing letters, 67(2), 1998, pp. 95-103
PROCESS ALGEBRA WITH PROPOSITIONAL SIGNALS
Authors: BAETEN JCM BERGSTRA JA
Citation: Jcm. Baeten et Ja. Bergstra, PROCESS ALGEBRA WITH PROPOSITIONAL SIGNALS, Theoretical computer science, 177(2), 1997, pp. 381-405
GRID PROTOCOLS BASED ON SYNCHRONOUS COMMUNICATION
Authors: BERGSTRA JA HILLEBRAND JA PONSE A
Citation: Ja. Bergstra et al., GRID PROTOCOLS BASED ON SYNCHRONOUS COMMUNICATION, Science of computer programming, 29(1-2), 1997, pp. 199-233
TOWARD A COMPLETE TRANSFORMATIONAL TOOLKIT FOR COMPILERS
Authors: BERGSTRA JA DINESH TB FIELD J HEERING J
Citation: Ja. Bergstra et al., TOWARD A COMPLETE TRANSFORMATIONAL TOOLKIT FOR COMPILERS, ACM transactions on programming languages and systems, 19(5), 1997, pp. 639-684
NETWORK ALGEBRA FOR ASYNCHRONOUS DATA-FLOW
Authors: BERGSTRA JA MIDDELBURG CA STEFANESCU G
Citation: Ja. Bergstra et al., NETWORK ALGEBRA FOR ASYNCHRONOUS DATA-FLOW, International journal of computer mathematics, 65(1-2), 1997, pp. 57-88
STRATEGIC DIRECTIONS IN CONCURRENCY RESEARCH
Authors: CLEAVELAND R SMOLKA SA ALUR R BAETEN J BERGSTRA JA BEST E DENICOLA R GILL H GORRIERI R GOUDA MG GROOTE JF HENZINGER TA HOARE CAR LUGINBUHL D MEYER A MILLER D MISRA J MOLLER F MONTANARI U PNUELI A PRASAD S PRATT VR SIFAKIS J SMOLKACHAIR SA STEFFEN B THOMSEN B VAANDRAGER F VARDI M WOLPER P
Citation: R. Cleaveland et al., STRATEGIC DIRECTIONS IN CONCURRENCY RESEARCH, ACM computing surveys, 28(4), 1996, pp. 607-625
ALGEBRA OF TIMED FRAMES
Authors: BERGSTRA JA FOKKINK WJ MIDDELBURG CA
Citation: Ja. Bergstra et al., ALGEBRA OF TIMED FRAMES, International journal of computer mathematics, 61(3-4), 1996, pp. 227-255
AXIOMATIZING PROBABILISTIC PROCESSES - ACP WITH GENERATIVE PROBABILITIES
Authors: BAETEN JCM BERGSTRA JA SMOLKA SA
Citation: Jcm. Baeten et al., AXIOMATIZING PROBABILISTIC PROCESSES - ACP WITH GENERATIVE PROBABILITIES, Information and computation, 121(2), 1995, pp. 234-255
HOMOMORPHISM PRESERVING ALGEBRAIC SPECIFICATIONS REQUIRE HIDDEN SORTS
Authors: BERGSTRA JA HEERING J
Citation: Ja. Bergstra et J. Heering, HOMOMORPHISM PRESERVING ALGEBRAIC SPECIFICATIONS REQUIRE HIDDEN SORTS, Information and computation, 119(1), 1995, pp. 119-123
THE DATA TYPE VARIETY OF STACK ALGEBRAS
Authors: BERGSTRA JA TUCKER JV
Citation: Ja. Bergstra et Jv. Tucker, THE DATA TYPE VARIETY OF STACK ALGEBRAS, Annals of pure and applied Logic, 73(1), 1995, pp. 11-36
EQUATIONAL SPECIFICATIONS, COMPLETE TERM REWRITING-SYSTEMS, AND COMPUTABLE AND SEMICOMPUTABLE ALGEBRAS
Authors: BERGSTRA JA TUCKER JV
Citation: Ja. Bergstra et Jv. Tucker, EQUATIONAL SPECIFICATIONS, COMPLETE TERM REWRITING-SYSTEMS, AND COMPUTABLE AND SEMICOMPUTABLE ALGEBRAS, Journal of the Association for Computing Machinery, 42(6), 1995, pp. 1194-1230
WHICH DATA-TYPES HAVE OMEGA-COMPLETE INITIAL ALGEBRA SPECIFICATIONS
Authors: BERGSTRA JA HEERING J
Citation: Ja. Bergstra et J. Heering, WHICH DATA-TYPES HAVE OMEGA-COMPLETE INITIAL ALGEBRA SPECIFICATIONS, Theoretical computer science, 124(1), 1994, pp. 149-168
BISIMULATION IN 2-WAY SIMULATION
Authors: BERGSTRA JA STEFANESCU G
Citation: Ja. Bergstra et G. Stefanescu, BISIMULATION IN 2-WAY SIMULATION, Information processing letters, 52(6), 1994, pp. 285-287
PROCESS ALGEBRA WITH ITERATION AND NESTING
Authors: BERGSTRA JA BETHKE I PONSE A
Citation: Ja. Bergstra et al., PROCESS ALGEBRA WITH ITERATION AND NESTING, Computer journal, 37(4), 1994, pp. 243-258
PROCESS ALGEBRA WITH ITERATION AND NESTING
Authors: BERGSTRA JA BETHKE I PONSE A
Citation: Ja. Bergstra et al., PROCESS ALGEBRA WITH ITERATION AND NESTING, Computer journal, 37(4), 1994, pp. 243-258
DECIDABILITY OF BISIMULATION EQUIVALENCE FOR PROCESSES GENERATING CONTEXT-FREE LANGUAGES
Authors: BAETEN JCM BERGSTRA JA KLOP JW
Citation: Jcm. Baeten et al., DECIDABILITY OF BISIMULATION EQUIVALENCE FOR PROCESSES GENERATING CONTEXT-FREE LANGUAGES, Journal of the Association for Computing Machinery, 40(3), 1993, pp. 653-682
Risultati: 1-17 |