Jos C. M. Baeten

According to our database1, Jos C. M. Baeten
  • authored at least 94 papers between 1987 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract).
Proceedings of the Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics and 14th Workshop on Structural Operational Semantics, 2017

Sequential Composition in the Presence of Intermediate Termination.
CoRR, 2017

2016
Expressiveness modulo bisimilarity of regular expressions with parallel composition.
Mathematical Structures in Computer Science, 2016

2015
The role of supervisory controller synthesis in automatic control software development.
Sci. Comput. Program., 2015

2014
Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi.
Proceedings of the Computational Logic, 2014

2013
Reactive Turing machines.
Inf. Comput., 2013

2012
Reconciling real and stochastic time: the need for probabilistic refinement.
Formal Asp. Comput., 2012

When Turing Meets Milner.
ERCIM News, 2012

Partially-Supervised Plants: Embedding Control Requirements in Plant Components.
Proceedings of the Integrated Formal Methods - 9th International Conference, 2012

Turing Meets Milner.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Unguardedness mostly means many solutions.
Theor. Comput. Sci., 2011

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

Reactive Turing Machines
CoRR, 2011

Computations and Interaction.
Proceedings of the Distributed Computing and Internet Technology, 2011

Reactive Turing Machines.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

2009
Preface.
J. Log. Algebr. Program., 2009

A Basic Parallel Process as a Parallel Pushdown Automaton.
Electr. Notes Theor. Comput. Sci., 2009

Design of asynchronous supervisors
CoRR, 2009

A Process-Theoretic Look at Automata.
Proceedings of the Fundamentals of Software Engineering, 2009

2008
A ground-complete axiomatisation of finite-state processes in a generic process algebra.
Mathematical Structures in Computer Science, 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.
J. Log. Algebr. Program., 2008

Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi.
Electr. Notes Theor. Comput. Sci., 2008

Applying Concurrency Research in Industry Report on a Strategic Workshop.
Bulletin of the EATCS, 2008

A Context-Free Process as a Pushdown Automaton.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Calculating with Automata.
Proceedings of the Concurrency, 2008

2007
Process Algebra.
Proceedings of the Handbook of Dynamic System Modeling., 2007

Preface.
Theor. Comput. Sci., 2007

Preface.
Theor. Comput. Sci., 2007

Duplication of constants in process algebra.
J. Log. Algebr. Program., 2007

A characterization of regular expressions under bisimulation.
J. ACM, 2007

2006
Preface.
Theor. Comput. Sci., 2006

Guest editors' introduction: Special issue on Process Theory for Hybrid Systems.
J. Log. Algebr. Program., 2006

Preface.
Electr. Notes Theor. Comput. Sci., 2006

A Generic Process Algebra.
Electr. Notes Theor. Comput. Sci., 2006

Six Themes for Future Concurrency Research.
Electr. Notes Theor. Comput. Sci., 2006

A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
A brief history of process algebra.
Theor. Comput. Sci., 2005

Analyzing a chi model of a turntable system using Spin, CADP and Uppaal.
J. Log. Algebr. Program., 2005

Preface.
Electr. Notes Theor. Comput. Sci., 2005

Regular Expressions in Process Algebra.
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.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Timing the Untimed: Terminating Successfully While Being Conservative.
Proceedings of the Processes, 2005

2004
Axiomatizing GSOS with termination.
J. Log. Algebr. Program., 2004

Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing).
Proceedings of the Formal Methods for the Design of Real-Time Systems, 2004

2003
Embedding Untimed Into Timed Process Algebra: The Case For Explicit Termination.
Mathematical Structures in Computer Science, 2003

Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems.
J. Log. Algebr. Program., 2003

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

Alternative composition does not imply non-determinism.
Bulletin of the EATCS, 2002

Axiomatizing GSOS with Termination.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2001
Real time process algebra with time-dependent conditions.
J. Log. Algebr. Program., 2001

Timed Process Algebras.
Electr. Notes Theor. Comput. Sci., 2001

Abstraction in Probabilistic Process Algebra.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2001

An MSC Based Representation of DiCons.
Proceedings of the SDL 2001: Meeting UML, 2001

Specifying internet applications with DiCons.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

2000
Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination.
Electr. Notes Theor. Comput. Sci., 2000

Discrete time process algebra with silent step.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1998
Deadlock Behaviour in Split and ST Bisimulation Semantics.
Electr. Notes Theor. Comput. Sci., 1998

1997
Process Algebra with Propositional Signals.
Theor. Comput. Sci., 1997

Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time.
Fundam. Inform., 1997

Bounded Stacks, Bags and Queues.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Discrete Time Process Algebra.
Formal Asp. Comput., 1996

Six Issues Concerning Future Directions in Concurrency Research.
ACM Comput. Surv., 1996

1995
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
Inf. Comput., September, 1995

Discrete Time Process Algebra with Abstraction.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994
On Sequential Compoisiton, Action Prefixes and Process Prefixes.
Formal Asp. Comput., 1994

A Real Time Process Logic.
Proceedings of the Temporal Logic, First International Conference, 1994

Delayed choice: an operator for joining Message Sequence Charts.
Proceedings of the Formal Description Techniques VII, 1994

Process Algebra with Partial Choice.
Proceedings of the CONCUR '94, 1994

1993
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
J. ACM, 1993

Real space process algebra.
Formal Asp. Comput., 1993

A Congruence Theorem for Structured Operational Semantics with Predicates.
Proceedings of the CONCUR '93, 1993

Non Interleaving Process Algebra.
Proceedings of the CONCUR '93, 1993

1992
An Algebra for Process Creation.
Acta Inf., 1992

The Total Order Assumption.
Proceedings of the NAPAW 92, 1992

Asynchronous Communication in Real Space Process Algebra.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1992

Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract).
Proceedings of the CONCUR '92, 1992

Discrete Time Process Algebra.
Proceedings of the CONCUR '92, 1992

1991
Recursive Process Definitions with the State Operator.
Theor. Comput. Sci., 1991

Real Time Process Algebra.
Formal Asp. Comput., 1991

The State Operator in Real Time Process Algebra.
Proceedings of the Real-Time: Theory in Practice, 1991

Real Space Process Algebra.
Proceedings of the CONCUR '91, 1991

1990
Process Algebra with a Zero Object.
Proceedings of the CONCUR '90, 1990

1989
Term-Rewriting Systems with Rule Priorities.
Theor. Comput. Sci., 1989

Design of a Specification Language by Abstract Syntax Engineering.
Proceedings of the Algebraic Methods II: Theory, 1989

A Process Specification Formalism Based on Static COLD.
Proceedings of the Algebraic Methods II: Theory, 1989

1988
Global Renaming Operators in Concrete Process Algebra
Inf. Comput., September, 1988

1987
On the Consistency of Koomen's Fair Abstraction Rule.
Theor. Comput. Sci., 1987

Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator.
Comput. J., 1987

Term Rewriting Systems with Priorities.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
Proceedings of the PARLE, 1987

Another Look at Abstraction in Process Algebra (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Merge and Termination in Process Algebra.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Semantics for Prolog via Term Rewrite Systems.
Proceedings of the Conditional Term Rewriting Systems, 1987


  Loading...