 | 2009 |
|---|
| 76 |       | Harsh Beohar,
Pieter J. L. Cuijpers,
Jos C. M. Baeten:
Design of asynchronous supervisors
CoRR abs/0910.0868: (2009) |
| 75 | | Jos C. M. Baeten,
Pieter J. L. Cuijpers,
P. J. A. van Tilburg:
A Basic Parallel Process as a Parallel Pushdown Automaton.
Electr. Notes Theor. Comput. Sci. 242(1): 35-48 (2009) |
| 2008 |
|---|
| 74 | | Jos C. M. Baeten,
Pieter J. L. Cuijpers,
P. J. A. van Tilburg:
A Context-Free Process as a Pushdown Automaton.
CONCUR 2008: 98-113 |
| 73 | | Jos C. M. Baeten:
Calculating with Automata.
Concurrency, Graphs and Models 2008: 747-756 |
| 72 | | Jos C. M. Baeten,
D. A. van Beek,
Pieter J. L. Cuijpers,
Michel A. Reniers,
J. E. Rooda,
Ramon R. H. Schiffelers,
R. J. M. Theunissen:
Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi.
Electr. Notes Theor. Comput. Sci. 209: 21-53 (2008) |
| 71 | | Jos C. M. Baeten,
Ana Sokolova:
Luca Aceto, Anna Ingólfsdóttir, Kim Guldstrand Larsen and Jiri Srba, Reactive Systems: Modelling, Specification and Verification , Cambridge University Press (2007) ISBN 9780521875462.
J. Log. Algebr. Program. 78(1): 52 (2008) |
| 70 | | Jos C. M. Baeten,
Mario Bravetti:
A ground-complete axiomatisation of finite-state processes in a generic process algebra.
Mathematical Structures in Computer Science 18(6): 1057-1089 (2008) |
| 2007 |
|---|
| 69 | | Jos C. M. Baeten,
Flavio Corradini,
Clemens Grabmayer:
A characterization of regular expressions under bisimulation.
J. ACM 54(2): (2007) |
| 68 | | Jos C. M. Baeten,
Michel A. Reniers:
Duplication of constants in process algebra.
J. Log. Algebr. Program. 70(2): 151-171 (2007) |
| 67 | | Jos C. M. Baeten,
Jan Karel Lenstra,
Gerhard J. Woeginger:
Preface.
Theor. Comput. Sci. 379(3): 305 (2007) |
| 66 | | Jos C. M. Baeten,
Iain C. C. Phillips:
Preface.
Theor. Comput. Sci. 386(3): 167-168 (2007) |
| 2006 |
|---|
| 65 | | Suzana Andova,
Jos C. M. Baeten,
Tim A. C. Willemse:
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification.
CONCUR 2006: 327-342 |
| 64 | | Jos C. M. Baeten,
Iain C. C. Phillips:
Preface.
Electr. Notes Theor. Comput. Sci. 154(3): 1-2 (2006) |
| 63 | | Jos C. M. Baeten,
Jan A. Bergstra:
Six Themes for Future Concurrency Research.
Electr. Notes Theor. Comput. Sci. 162: 61-64 (2006) |
| 62 | | Jos C. M. Baeten,
Mario Bravetti:
A Generic Process Algebra.
Electr. Notes Theor. Comput. Sci. 162: 65-71 (2006) |
| 61 | | Jos C. M. Baeten,
S. P. Luttik:
Guest editors' introduction: Special issue on Process Theory for Hybrid Systems.
J. Log. Algebr. Program. 68(1-2): 1-3 (2006) |
| 60 | | Jos C. M. Baeten,
Flavio Corradini:
Preface.
Theor. Comput. Sci. 356(3): 263-264 (2006) |
| 2005 |
|---|
| 59 | | Jos C. M. Baeten,
Mario Bravetti:
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra.
CONCUR 2005: 248-262 |
| 58 | | Jos C. M. Baeten,
Flavio Corradini:
Regular Expressions in Process Algebra.
LICS 2005: 12-19 |
| 57 | | Jos C. M. Baeten,
Mohammad Reza Mousavi,
Michel A. Reniers:
Timing the Untimed: Terminating Successfully While Being Conservative.
Processes, Terms and Cycles 2005: 251-279 |
| 56 | | Jos C. M. Baeten,
Flavio Corradini:
Preface.
Electr. Notes Theor. Comput. Sci. 128(2): 1-3 (2005) |
| 55 | | E. M. Bortnik,
Nikola Trcka,
Anton Wijs,
Bas Luttik,
J. M. van de Mortel-Fronczak,
Jos C. M. Baeten,
Wan Fokkink,
J. E. Rooda:
Analyzing a chi model of a turntable system using Spin, CADP and Uppaal.
J. Log. Algebr. Program. 65(2): 51-104 (2005) |
| 54 | | Jos C. M. Baeten:
A brief history of process algebra.
Theor. Comput. Sci. 335(2-3): 131-146 (2005) |
| 2004 |
|---|
| 53 | | Jos C. M. Baeten,
Michel A. Reniers:
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing).
SFM 2004: 59-97 |
| 52 | | Jos C. M. Baeten,
Erik P. de Vink:
Axiomatizing GSOS with termination.
J. Log. Algebr. Program. 60-61: 323-351 (2004) |
| 2003 |
|---|
| 51 |  | Jos C. M. Baeten,
Jan Karel Lenstra,
Joachim Parrow,
Gerhard J. Woeginger:
Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings
Springer 2003 |
| 50 | | Pedro R. D'Argenio,
Jos C. M. Baeten:
Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems.
J. Log. Algebr. Program. 56(1-2): 1-2 (2003) |
| 49 | | Jos C. M. Baeten:
Embedding Untimed Into Timed Process Algebra: The Case For Explicit Termination.
Mathematical Structures in Computer Science 13(4): 589-618 (2003) |
| 2002 |
|---|
| 48 | | Jos C. M. Baeten,
Erik P. de Vink:
Axiomatizing GSOS with Termination.
STACS 2002: 583-595 |
| 47 | | Suzana Andova,
Jos C. M. Baeten:
Alternative composition does not imply non-determinism.
Bulletin of the EATCS 76: 125-127 (2002) |
| 2001 |
|---|
| 46 | | Jos C. M. Baeten,
Harm M. A. van Beek,
Sjouke Mauw:
Specifying internet applications with DiCons.
SAC 2001: 576-584 |
| 45 | | Jos C. M. Baeten,
Harm M. A. van Beek,
Sjouke Mauw:
An MSC Based Representation of DiCons.
SDL Forum 2001: 328-347 |
| 44 | | Suzana Andova,
Jos C. M. Baeten:
Abstraction in Probabilistic Process Algebra.
TACAS 2001: 204-219 |
| 43 | | Jos C. M. Baeten:
Timed Process Algebras.
Electr. Notes Theor. Comput. Sci. 52(3): (2001) |
| 42 | | Jos C. M. Baeten,
C. A. Middelburg:
Real time process algebra with time-dependent conditions.
J. Log. Algebr. Program. 48(1-2): 1-38 (2001) |
| 2000 |
|---|
| 41 | | Jos C. M. Baeten,
Jan A. Bergstra,
Michel A. Reniers:
Discrete time process algebra with silent step.
Proof, Language, and Interaction 2000: 535-570 |
| 40 | | Jos C. M. Baeten:
Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination.
Electr. Notes Theor. Comput. Sci. 39(1): (2000) |
| 1999 |
|---|
| 39 | | Jos C. M. Baeten,
Sjouke Mauw:
CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings
Springer 1999 |
| 1998 |
|---|
| 38 | | Jos C. M. Baeten,
Jan A. Bergstra:
Deadlock Behaviour in Split and ST Bisimulation Semantics.
Electr. Notes Theor. Comput. Sci. 16(2): (1998) |
| 1997 |
|---|
| 37 | | Jos C. M. Baeten,
Jan A. Bergstra:
Bounded Stacks, Bags and Queues.
CONCUR 1997: 104-118 |
| 36 | | Jos C. M. Baeten,
Jan A. Bergstra:
Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time.
Fundam. Inform. 29(1-2): 51-76 (1997) |
| 35 | | Jos C. M. Baeten,
Jan A. Bergstra:
Process Algebra with Propositional Signals.
Theor. Comput. Sci. 177(2): 381-405 (1997) |
| 1996 |
|---|
| 34 | | Jos C. M. Baeten,
Jan A. Bergstra:
Six Issues Concerning Future Directions in Concurrency Research.
ACM Comput. Surv. 28(4es): 39 (1996) |
| 33 | | Jos C. M. Baeten,
Jan A. Bergstra:
Discrete Time Process Algebra.
Formal Asp. Comput. 8(2): 188-208 (1996) |
| 1995 |
|---|
| 32 | | Jos C. M. Baeten,
Jan A. Bergstra:
Discrete Time Process Algebra with Abstraction.
FCT 1995: 1-15 |
| 31 | | Jos C. M. Baeten,
Jan A. Bergstra,
Scott A. Smolka:
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
Inf. Comput. 121(2): 234-255 (1995) |
| 1994 |
|---|
| 30 | | Jos C. M. Baeten,
Jan A. Bergstra:
Process Algebra with Partial Choice.
CONCUR 1994: 465-480 |
| 29 | | Jos C. M. Baeten,
Sjouke Mauw:
Delayed choice: an operator for joining Message Sequence Charts.
FORTE 1994: 340-354 |
| 28 | | Jos C. M. Baeten,
Jan A. Bergstra,
Roland N. Bol:
A Real Time Process Logic.
ICTL 1994: 30-47 |
| 27 | | Jos C. M. Baeten,
Jan A. Bergstra:
On Sequential Compoisiton, Action Prefixes and Process Prefixes.
Formal Asp. Comput. 6(3): 250-268 (1994) |
| 1993 |
|---|
| 26 | | Jos C. M. Baeten,
Jan A. Bergstra:
Non Interleaving Process Algebra.
CONCUR 1993: 308-323 |
| 25 | | Jos C. M. Baeten,
Chris Verhoef:
A Congruence Theorem for Structured Operational Semantics with Predicates.
CONCUR 1993: 477-492 |
| 24 | | Jos C. M. Baeten,
Jan A. Bergstra,
Jan Willem Klop:
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
J. ACM 40(3): 653-682 (1993) |
| 1992 |
|---|
| 23 | | Jos C. M. Baeten,
Jan A. Bergstra:
Discrete Time Process Algebra.
CONCUR 1992: 401-420 |
| 22 | | Jos C. M. Baeten,
Jan A. Bergstra,
Scott A. Smolka:
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract).
CONCUR 1992: 472-485 |
| 21 | | Jos C. M. Baeten,
Jan A. Bergstra:
Asynchronous Communication in Real Space Process Algebra.
FTRTFT 1992: 473-492 |
| 20 | | Jos C. M. Baeten:
The Total Order Assumption.
NAPAW 1992: 231-240 |
| 19 | | Jos C. M. Baeten,
Frits W. Vaandrager:
An Algebra for Process Creation.
Acta Inf. 29(4): 303-334 (1992) |
| 1991 |
|---|
| 18 | | Jos C. M. Baeten,
Jan Friso Groote:
CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings
Springer 1991 |
| 17 | | Jos C. M. Baeten,
Jan A. Bergstra:
Real Space Process Algebra.
CONCUR 1991: 96-110 |
| 16 | | Jos C. M. Baeten,
Jan A. Bergstra:
The State Operator in Real Time Process Algebra.
REX Workshop 1991: 107-123 |
| 15 | | Jos C. M. Baeten,
Jan A. Bergstra:
Real Time Process Algebra.
Formal Asp. Comput. 3(2): 142-188 (1991) |
| 14 | | Jos C. M. Baeten,
Jan A. Bergstra:
Recursive Process Definitions with the State Operator.
Theor. Comput. Sci. 82(2): 285-302 (1991) |
| 1990 |
|---|
| 13 | | Jos C. M. Baeten,
Jan Willem Klop:
CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27-30, 1990, Proceedings
Springer 1990 |
| 12 | | Jos C. M. Baeten,
Jan A. Bergstra:
Process Algebra with a Zero Object.
CONCUR 1990: 83-98 |
| 1989 |
|---|
| 11 | | Jos C. M. Baeten,
Jan A. Bergstra,
Sjouke Mauw,
Gert J. Veltink:
A Process Specification Formalism Based on Static COLD.
Algebraic Methods 1989: 303-335 |
| 10 | | Jos C. M. Baeten,
Jan A. Bergstra:
Design of a Specification Language by Abstract Syntax Engineering.
Algebraic Methods 1989: 363-394 |
| 9 | | Jos C. M. Baeten,
Jan A. Bergstra,
Jan Willem Klop,
W. P. Weijland:
Term-Rewriting Systems with Rule Priorities.
Theor. Comput. Sci. 67(2&3): 283-301 (1989) |
| 1988 |
|---|
| 8 | | Jos C. M. Baeten,
Jan A. Bergstra:
Global Renaming Operators in Concrete Process Algebra
Inf. Comput. 78(3): 205-245 (1988) |
| 1987 |
|---|
| 7 | | Jos C. M. Baeten,
W. P. Weijland:
Semantics for Prolog via Term Rewrite Systems.
CTRS 1987: 3-14 |
| 6 | | Jos C. M. Baeten,
Rob J. van Glabbeek:
Merge and Termination in Process Algebra.
FSTTCS 1987: 153-172 |
| 5 | | Jos C. M. Baeten,
Rob J. van Glabbeek:
Another Look at Abstraction in Process Algebra (Extended Abstract).
ICALP 1987: 84-94 |
| 4 | | Jos C. M. Baeten,
Jan A. Bergstra,
Jan Willem Klop:
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
PARLE (2) 1987: 94-111 |
| 3 | | Jos C. M. Baeten,
Jan A. Bergstra,
Jan Willem Klop:
Term Rewriting Systems with Priorities.
RTA 1987: 83-94 |
| 2 | | Jos C. M. Baeten,
Jan A. Bergstra,
Jan Willem Klop:
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator.
Comput. J. 30(6): 498-506 (1987) |
| 1 | | Jos C. M. Baeten,
Jan A. Bergstra,
Jan Willem Klop:
On the Consistency of Koomen's Fair Abstraction Rule.
Theor. Comput. Sci. 51: 129-176 (1987) |
