Jos C. M. Baeten

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg: When Turing Meets Milner. ERCIM News 2012(91) (2012)

Jasen Markovski, Pedro R. D'Argenio, Jos C. M. Baeten, Erik P. de Vink: Reconciling real and stochastic time: the need for probabilistic refinement. Formal Asp. Comput. 24(4-6): 497-518 (2012)

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg: Turing Meets Milner. CONCUR 2012: 1-20

Jasen Markovski, Dirk A. van Beek, Jos C. M. Baeten: Partially-Supervised Plants: Embedding Control Requirements in Plant Components. IFM 2012: 253-267

Jos C. M. Baeten, Thomas Ball, Frank S. de Boer (Eds.): Theoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings. Lecture Notes in Computer Science 7604, Springer 2012, isbn 978-3-642-33474-0

Jos C. M. Baeten, Bas Luttik: Unguardedness mostly means many solutions. Theor. Comput. Sci. 412(28): 3090-3100 (2011)

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg: Reactive Turing Machines. FCT 2011: 348-359

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg: Computations and Interaction. ICDCIT 2011: 35-54

Jos C. M. Baeten, Bert van Beek, Allan van Hulst, Jasen Markovski: A Process Algebra for Supervisory Coordination. PACO 2011: 36-55

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg: Reactive Turing Machines. CoRR abs/1104.1738 (2011)

Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg: Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract). EXPRESS'10 2010: 1-15

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)

Luca Aceto, Jos C. M. Baeten, Wan Fokkink, Anna Ingólfsdóttir, Uwe Nestmann: Preface. J. Log. Algebr. Program. 78(4) (2009)

Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Luttik, P. J. A. van Tilburg: A Process-Theoretic Look at Automata. FSEN 2009: 1-33

Harsh Beohar, Pieter J. L. Cuijpers, Jos C. M. Baeten: Design of asynchronous supervisors. CoRR abs/0910.0868 (2009)

Luca Aceto, Jos C. M. Baeten, Wan Fokkink, Anna Ingólfsdóttir, Uwe Nestmann: Applying Concurrency Research in Industry Report on a Strategic Workshop. Bulletin of the EATCS 94: 113-129 (2008)

Jos C. M. Baeten, Dirk A. van Beek, Pieter J. L. Cuijpers, Michel A. Reniers, J. E. Rooda, Ramon R. H. Schiffelers, Rolf J. M. Theunissen: Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi. Electr. Notes Theor. Comput. Sci. 209: 21-53 (2008)

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)

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)

Jos C. M. Baeten: Calculating with Automata. Concurrency, Graphs and Models 2008: 747-756

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

Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer: A characterization of regular expressions under bisimulation. J. ACM 54(2) (2007)

Jos C. M. Baeten, Michel A. Reniers: Duplication of constants in process algebra. J. Log. Algebr. Program. 70(2): 151-171 (2007)

Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger: Preface. Theor. Comput. Sci. 379(3): 305 (2007)

Jos C. M. Baeten, Iain C. C. Phillips: Preface. Theor. Comput. Sci. 386(3): 167-168 (2007)

Jos C. M. Baeten, Iain C. C. Phillips: Preface. Electr. Notes Theor. Comput. Sci. 154(3): 1-2 (2006)

Jos C. M. Baeten, Jan A. Bergstra: Six Themes for Future Concurrency Research. Electr. Notes Theor. Comput. Sci. 162: 61-64 (2006)

Jos C. M. Baeten, Mario Bravetti: A Generic Process Algebra. Electr. Notes Theor. Comput. Sci. 162: 65-71 (2006)

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)

Jos C. M. Baeten, Flavio Corradini: Preface. Theor. Comput. Sci. 356(3): 263-264 (2006)

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

Jos C. M. Baeten, Flavio Corradini: Preface. Electr. Notes Theor. Comput. Sci. 128(2): 1-3 (2005)

Elena 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)

Jos C. M. Baeten: A brief history of process algebra. Theor. Comput. Sci. 335(2-3): 131-146 (2005)

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

Jos C. M. Baeten, Mario Bravetti: A Ground-Complete Axiomatization of Finite State Processes in Process Algebra. CONCUR 2005: 248-262

Jos C. M. Baeten, Flavio Corradini: Regular Expressions in Process Algebra. LICS 2005: 12-19

Jos C. M. Baeten, Erik P. de Vink: Axiomatizing GSOS with termination. J. Log. Algebr. Program. 60-61: 323-351 (2004)

Jos C. M. Baeten, Michel A. Reniers: Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing). SFM 2004: 59-97

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)

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)

Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger (Eds.): Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Lecture Notes in Computer Science 2719, Springer 2003, isbn 3-540-40493-7

Suzana Andova, Jos C. M. Baeten: Alternative composition does not imply non-determinism. Bulletin of the EATCS 76: 125-127 (2002)

Jos C. M. Baeten, Erik P. de Vink: Axiomatizing GSOS with Termination. STACS 2002: 583-595

Jos C. M. Baeten: Timed Process Algebras. Electr. Notes Theor. Comput. Sci. 52(3): 207-208 (2001)

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)

Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw: Specifying internet applications with DiCons. SAC 2001: 576-584

Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw: An MSC Based Representation of DiCons. SDL Forum 2001: 328-347

Suzana Andova, Jos C. M. Baeten: Abstraction in Probabilistic Process Algebra. TACAS 2001: 204-219

Jos C. M. Baeten: Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination. Electr. Notes Theor. Comput. Sci. 39(1): 3-20 (2000)

Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers: Discrete time process algebra with silent step. Proof, Language, and Interaction 2000: 535-570

Jos C. M. Baeten, Sjouke Mauw (Eds.): CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings. Lecture Notes in Computer Science 1664, Springer 1999, isbn 3-540-66425-4

Jos C. M. Baeten, Jan A. Bergstra: Deadlock Behaviour in Split and ST Bisimulation Semantics. Electr. Notes Theor. Comput. Sci. 16(2): 61-74 (1998)

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)

Jos C. M. Baeten, Jan A. Bergstra: Process Algebra with Propositional Signals. Theor. Comput. Sci. 177(2): 381-405 (1997)

Jos C. M. Baeten, Jan A. Bergstra: Bounded Stacks, Bags and Queues. CONCUR 1997: 104-118

Jos C. M. Baeten, Jan A. Bergstra: Six Issues Concerning Future Directions in Concurrency Research. ACM Comput. Surv. 28(4es): 39 (1996)

Jos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra. Formal Asp. Comput. 8(2): 188-208 (1996)

Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka: Axiomatizing Probabilistic Processes: ACP with Generative Probabilities. Inf. Comput. 121(2): 234-255 (1995)

Jos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra with Abstraction. FCT 1995: 1-15

Jos C. M. Baeten, Jan A. Bergstra: On Sequential Compoisiton, Action Prefixes and Process Prefixes. Formal Asp. Comput. 6(3): 250-268 (1994)

Jos C. M. Baeten, Jan A. Bergstra: Process Algebra with Partial Choice. CONCUR 1994: 465-480

Jos C. M. Baeten, Sjouke Mauw: Delayed choice: an operator for joining Message Sequence Charts. FORTE 1994: 340-354

Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol: A Real Time Process Logic. ICTL 1994: 30-47

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)

Jos C. M. Baeten, Jan A. Bergstra: Non Interleaving Process Algebra. CONCUR 1993: 308-323

Jos C. M. Baeten, Chris Verhoef: A Congruence Theorem for Structured Operational Semantics with Predicates. CONCUR 1993: 477-492

Jos C. M. Baeten, Frits W. Vaandrager: An Algebra for Process Creation. Acta Inf. 29(4): 303-334 (1992)

Jos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra. CONCUR 1992: 401-420

Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka: Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). CONCUR 1992: 472-485

Jos C. M. Baeten, Jan A. Bergstra: Asynchronous Communication in Real Space Process Algebra. FTRTFT 1992: 473-492

Jos C. M. Baeten: The Total Order Assumption. NAPAW 1992: 231-240

Jos C. M. Baeten, Jan A. Bergstra: Real Time Process Algebra. Formal Asp. Comput. 3(2): 142-188 (1991)

Jos C. M. Baeten, Jan A. Bergstra: Recursive Process Definitions with the State Operator. Theor. Comput. Sci. 82(2): 285-302 (1991)

Jos C. M. Baeten, Jan A. Bergstra: Real Space Process Algebra. CONCUR 1991: 96-110

Jos C. M. Baeten, Jan A. Bergstra: The State Operator in Real Time Process Algebra. REX Workshop 1991: 107-123

Jos C. M. Baeten, Jan Friso Groote (Eds.): CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings. Lecture Notes in Computer Science 527, Springer 1991, isbn 3-540-54430-5

Jos C. M. Baeten, Jan A. Bergstra: Process Algebra with a Zero Object. CONCUR 1990: 83-98

Jos C. M. Baeten, Jan Willem Klop (Eds.): CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27-30, 1990, Proceedings. Lecture Notes in Computer Science 458, Springer 1990, isbn 3-540-53048-7

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)

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

Jos C. M. Baeten, Jan A. Bergstra: Design of a Specification Language by Abstract Syntax Engineering. Algebraic Methods 1989: 363-394

Jos C. M. Baeten, Jan A. Bergstra: Global Renaming Operators in Concrete Process Algebra. Inf. Comput. 78(3): 205-245 (1988)

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)

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)

Jos C. M. Baeten, W. P. Weijland: Semantics for Prolog via Term Rewrite Systems. CTRS 1987: 3-14

Jos C. M. Baeten, Rob J. van Glabbeek: Merge and Termination in Process Algebra. FSTTCS 1987: 153-172

Jos C. M. Baeten, Rob J. van Glabbeek: Another Look at Abstraction in Process Algebra (Extended Abstract). ICALP 1987: 84-94

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

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop: Term Rewriting Systems with Priorities. RTA 1987: 83-94