Jos C. M. Baeten

According to our database, Jos C. M. Baeten authored at least 94 papers between 1987 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics.

Jos C. M. Baeten, Cesare Carissimo, Bas Luttik

Log. Methods Comput. Sci., 2023

Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract).

Jos C. M. Baeten, Bas Luttik

Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

2020

CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper).

Luca Aceto, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity.

Astrid Belder, Bas Luttik, Jos C. M. Baeten

Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2017

Sequential Composition in the Presence of Intermediate Termination (Extended Abstract).

Jos C. M. Baeten, Bas Luttik, Fei Yang

Proceedings of the Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics, 2017

Sequential Composition in the Presence of Intermediate Termination.

Jos C. M. Baeten, Bas Luttik, Fei Yang

CoRR, 2017

2016

Expressiveness modulo bisimilarity of regular expressions with parallel composition.

Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg

Math. Struct. Comput. Sci., 2016

2015

The role of supervisory controller synthesis in automatic control software development.

Jos C. M. Baeten, Jasen Markovski

Sci. Comput. Program., 2015

2014

Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi.

Jos C. M. Baeten, Davide Sangiorgi

Proceedings of the Computational Logic, 2014

2013

Reactive Turing machines.

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg

Inf. Comput., 2013

2012

Reconciling real and stochastic time: the need for probabilistic refinement.

Jasen Markovski, Pedro R. D'Argenio, Jos C. M. Baeten, Erik P. de Vink

Formal Aspects Comput., 2012

When Turing Meets Milner.

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg

ERCIM News, 2012

Partially-Supervised Plants: Embedding Control Requirements in Plant Components.

Jasen Markovski, Dirk A. van Beek, Jos C. M. Baeten

Proceedings of the Integrated Formal Methods - 9th International Conference, 2012

Turing Meets Milner.

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

Unguardedness mostly means many solutions.

Jos C. M. Baeten, Bas Luttik

Theor. Comput. Sci., 2011

A Process Algebra for Supervisory Coordination

Jos C. M. Baeten, Bert van Beek, Allan van Hulst, Jasen Markovski

Proceedings of the Proceedings First International Workshop on Process Algebra and Coordination, 2011

Computations and Interaction.

Jos C. M. Baeten, Bas Luttik, Paul van Tilburg

Proceedings of the Distributed Computing and Internet Technology, 2011

A process-theoretic approach to supervisory control theory.

Jos C. M. Baeten, D. A. van Beek, Bas Luttik, Jasen Markovski, Jacobus E. Rooda

Proceedings of the American Control Conference, 2011

2010

Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)

Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg

Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

2009

Preface.

Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann

J. Log. Algebraic Methods Program., 2009

Design of asynchronous supervisors

Harsh Beohar, Pieter J. L. Cuijpers, Jos C. M. Baeten

CoRR, 2009

A Process-Theoretic Look at Automata.

Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Luttik, P. J. A. van Tilburg

Proceedings of the Fundamentals of Software Engineering, 2009

2008

A ground-complete axiomatisation of finite-state processes in a generic process algebra.

Jos C. M. Baeten, Mario Bravetti

Math. Struct. Comput. Sci., 2008

Luca Aceto, Anna Ingólfsdóttir, Kim Guldstrand Larsen and Jiri Srba, Reactive Systems: Modelling, Specification and Verification , Cambridge University Press (2007) ISBN 9780521875462.

Jos C. M. Baeten, Ana Sokolova

J. Log. Algebraic Methods Program., 2008

A Basic Parallel Process as a Parallel Pushdown Automaton.

Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. van Tilburg

Proceedings of the 15th Workshop on Expressiveness in Concurrency, 2008

Applying Concurrency Research in Industry Report on a Strategic Workshop.

Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann

Bull. EATCS, 2008

A Context-Free Process as a Pushdown Automaton.

Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. van Tilburg

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Calculating with Automata.

Jos C. M. Baeten

Proceedings of the Concurrency, 2008

2007

Process Algebra.

Jacobus E. Rooda, D. A. van Beek, Jos C. M. Baeten

Proceedings of the Handbook of Dynamic System Modeling., 2007

Preface.

Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger

Theor. Comput. Sci., 2007

Duplication of constants in process algebra.

Jos C. M. Baeten, Michel A. Reniers

J. Log. Algebraic Methods Program., 2007

A characterization of regular expressions under bisimulation.

Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer

J. ACM, 2007

2006

Guest editors' introduction: Special issue on Process Theory for Hybrid Systems.

Jos C. M. Baeten, S. P. Luttik

J. Log. Algebraic Methods Program., 2006

Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi.

Jos C. M. Baeten, Dirk A. van Beek, Pieter J. L. Cuijpers, Michel A. Reniers, Jacobus E. Rooda, Ramon R. H. Schiffelers, Rolf J. M. Theunissen

Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, 2006

A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification.

Suzana Andova, Jos C. M. Baeten, Tim A. C. Willemse

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005

A brief history of process algebra.

Jos C. M. Baeten

Theor. Comput. Sci., 2005

Analyzing a <i>chi</i> model of a turntable system using Spin, CADP and Uppaal.

Elena M. Bortnik, Nikola Trcka, Anton Wijs, Bas Luttik, Joanna M. van de Mortel-Fronczak, Jos C. M. Baeten, Wan J. Fokkink, Jacobus E. Rooda

J. Log. Algebraic Methods Program., 2005

Preface.

Jos C. M. Baeten, Iain C. C. Phillips

Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005

A Generic Process Algebra.

Jos C. M. Baeten, Mario Bravetti

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Six Themes for Future Concurrency Research.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Regular Expressions in Process Algebra.

Jos C. M. Baeten, Flavio Corradini

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

A Ground-Complete Axiomatization of Finite State Processes in Process Algebra.

Jos C. M. Baeten, Mario Bravetti

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Timing the Untimed: Terminating Successfully While Being Conservative.

Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A. Reniers

Proceedings of the Processes, 2005

2004

Axiomatizing GSOS with termination.

Jos C. M. Baeten, Erik P. de Vink

J. Log. Algebraic Methods Program., 2004

Preface.

Jos C. M. Baeten, Flavio Corradini

Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004

Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing).

Jos C. M. Baeten, Michel A. Reniers

Proceedings of the Formal Methods for the Design of Real-Time Systems, 2004

2003

Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems.

Pedro R. D'Argenio, Jos C. M. Baeten

J. Log. Algebraic Methods Program., 2003

2002

Process Algebra with Timing

Jos C. M. Baeten, Cornelis A. Middelburg

Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04995-2, 2002

Alternative composition does not imply non-determinism.

Suzana Andova, Jos C. M. Baeten

Bull. EATCS, 2002

2001

Real time process algebra with time-dependent conditions.

Jos C. M. Baeten, Cornelis A. Middelburg

J. Log. Algebraic Methods Program., 2001

Timed Process Algebras.

Jos C. M. Baeten

Proceedings of the International Workshop on Models for Time-Critical Systems, 2001

Abstraction in Probabilistic Process Algebra.

Suzana Andova, Jos C. M. Baeten

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2001

An MSC Based Representation of DiCons.

Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw

Proceedings of the SDL 2001: Meeting UML, 2001

Specifying internet applications with DiCons.

Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw

Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

Process Algebra with Timing: Real Time and Discrete Time.

Jos C. M. Baeten, Cornelis A. Middelburg

Proceedings of the Handbook of Process Algebra, 2001

Partial-Order Process Algebra (and its Relation to Petri Nets).

Jos C. M. Baeten, Twan Basten

Proceedings of the Handbook of Process Algebra, 2001

2000

Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination.

Jos C. M. Baeten

Proceedings of the 7th International Workshop on Expressiveness in Concurrency, 2000

Discrete time process algebra with silent step.

Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1998

Deadlock Behaviour in Split and ST Bisimulation Semantics.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the Fifth International Workshop on Expressiveness in Concurrency, 1998

1997

Process Algebra with Propositional Signals.

Jos C. M. Baeten, Jan A. Bergstra

Theor. Comput. Sci., 1997

Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time.

Jos C. M. Baeten, Jan A. Bergstra

Fundam. Informaticae, 1997

Bounded Stacks, Bags and Queues.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996

Discrete Time Process Algebra.

Jos C. M. Baeten, Jan A. Bergstra

Formal Aspects Comput., 1996

Six Issues Concerning Future Directions in Concurrency Research.

Jos C. M. Baeten, Jan A. Bergstra

ACM Comput. Surv., 1996

1995

Axiomatizing Probabilistic Processes: ACP with Generative Probabilities

Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka

Inf. Comput., September, 1995

Discrete Time Process Algebra with Abstraction.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

On Sequential Compoisiton, Action Prefixes and Process Prefixes.

Jos C. M. Baeten, Jan A. Bergstra

Formal Aspects Comput., 1994

A Real Time Process Logic.

Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol

Proceedings of the Temporal Logic, First International Conference, 1994

Delayed choice: an operator for joining Message Sequence Charts.

Jos C. M. Baeten, Sjouke Mauw

Proceedings of the Formal Description Techniques VII, 1994

Process Algebra with Partial Choice.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the CONCUR '94, 1994

1993

Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

J. ACM, 1993

Real space process algebra.

Jos C. M. Baeten, Jan A. Bergstra

Formal Aspects Comput., 1993

A Congruence Theorem for Structured Operational Semantics with Predicates.

Jos C. M. Baeten, Chris Verhoef

Proceedings of the CONCUR '93, 1993

Non Interleaving Process Algebra.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the CONCUR '93, 1993

1992

An Algebra for Process Creation.

Jos C. M. Baeten, Frits W. Vaandrager

Acta Informatica, 1992

The Total Order Assumption.

Jos C. M. Baeten

Proceedings of the NAPAW 92, 1992

Asynchronous Communication in Real Space Process Algebra.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1992

Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract).

Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka

Proceedings of the CONCUR '92, 1992

1991

Recursive Process Definitions with the State Operator.

Jos C. M. Baeten, Jan A. Bergstra

Theor. Comput. Sci., 1991

Real Time Process Algebra.

Jos C. M. Baeten, Jan A. Bergstra

Formal Aspects Comput., 1991

The State Operator in Real Time Process Algebra.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the Real-Time: Theory in Practice, 1991

1990

Process Algebra with a Zero Object.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the CONCUR '90, 1990

Process algebra.

Jos C. M. Baeten, W. P. Weijland

Cambridge tracts in theoretical computer science 18, Cambridge University Press, ISBN: 978-0-521-40043-5, 1990

1989

Term-Rewriting Systems with Rule Priorities.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland

Theor. Comput. Sci., 1989

Design of a Specification Language by Abstract Syntax Engineering.

Jos C. M. Baeten, Jan A. Bergstra

Proceedings of the Algebraic Methods II: Theory, 1989

A Process Specification Formalism Based on Static COLD.

Jos C. M. Baeten, Jan A. Bergstra, Sjouke Mauw, Gert J. Veltink

Proceedings of the Algebraic Methods II: Theory, 1989

1988

Global Renaming Operators in Concrete Process Algebra

Jos C. M. Baeten, Jan A. Bergstra

Inf. Comput., September, 1988

1987

On the Consistency of Koomen's Fair Abstraction Rule.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

Theor. Comput. Sci., 1987

Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

Comput. J., 1987

Term Rewriting Systems with Priorities.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Conditional axioms and α/β-calculus in process algebra.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

Another Look at Abstraction in Process Algebra (Extended Abstract).

Jos C. M. Baeten, Rob J. van Glabbeek

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Merge and Termination in Process Algebra.

Jos C. M. Baeten, Rob J. van Glabbeek

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Semantics for Prolog via Term Rewrite Systems.

Jos C. M. Baeten, W. P. Weijland

Proceedings of the Conditional Term Rewriting Systems, 1987