Jos C. M. Baeten

116 papers A* 3A 2B 21C 2Misc 2Journal 45Unranked 32

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	The Queue Automaton Revisited. Juggling Formal Methods and Security Jos C. M. Baeten, Bas Luttik
2025	J	`jnl`	The Queue Automaton Revisited. CoRR Jos C. M. Baeten, Bas Luttik
2024	—	`conf`	Sequential Value Passing Yields a Kleene Theorem for Processes. Logics and Type Systems in Theory and Practice Jos C. M. Baeten, Bas Luttik
2023	—	`conf`	Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract). EXPRESS/SOS Jos C. M. Baeten, Bas Luttik
2023	J	`jnl`	Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. Log. Methods Comput. Sci. Jos C. M. Baeten, Cesare Carissimo, Bas Luttik
2022	J	`jnl`	Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. CoRR Jos C. M. Baeten, Cesare Carissimo, Bas Luttik
2021	B	`conf`	Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. CALCO Jos C. M. Baeten, Cesare Carissimo, Bas Luttik
2020	B	`conf`	CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). CONCUR Luca Aceto, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva
2019	B	`conf`	Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity. CALCO Astrid Belder, Bas Luttik, Jos C. M. Baeten
2017	—	`conf`	Sequential Composition in the Presence of Intermediate Termination (Extended Abstract). EXPRESS/SOS Jos C. M. Baeten, Bas Luttik, Fei Yang
2017	J	`jnl`	Sequential Composition in the Presence of Intermediate Termination. CoRR Jos C. M. Baeten, Bas Luttik, Fei Yang
2016	J	`jnl`	ERCIM Goes to Open Access. ERCIM News Jos C. M. Baeten, Claude Kirchner
2016	J	`jnl`	Expressiveness modulo bisimilarity of regular expressions with parallel composition. Math. Struct. Comput. Sci. Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg
2015	J	`jnl`	The role of supervisory controller synthesis in automatic control software development. Sci. Comput. Program. Jos C. M. Baeten, Jasen Markovski
2014	—	`ch.`	Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi. Computational Logic Jos C. M. Baeten, Davide Sangiorgi
2013	J	`jnl`	Reactive Turing machines. Inf. Comput. Jos C. M. Baeten, Bas Luttik, Paul van Tilburg
2012	B	`conf`	Partially-Supervised Plants: Embedding Control Requirements in Plant Components. IFM Jasen Markovski, Dirk A. van Beek, Jos C. M. Baeten
2012	J	`jnl`	Reconciling real and stochastic time: the need for probabilistic refinement. Formal Aspects Comput. Jasen Markovski, Pedro R. D'Argenio, Jos C. M. Baeten, Erik P. de Vink
2012	—	`ed.`	Theoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings IFIP TCS Jos C. M. Baeten, Thomas Ball, Frank S. de Boer
2012	B	`conf`	Turing Meets Milner. CONCUR Jos C. M. Baeten, Bas Luttik, Paul van Tilburg
2012	J	`jnl`	When Turing Meets Milner. ERCIM News Jos C. M. Baeten, Bas Luttik, Paul van Tilburg
2011	—	`conf`	A Process Algebra for Supervisory Coordination PACO Jos C. M. Baeten, Bert van Beek, Allan van Hulst, Jasen Markovski
2011	C	`conf`	A process-theoretic approach to supervisory control theory. ACC Jos C. M. Baeten, D. A. van Beek, Bas Luttik, Jasen Markovski, Jacobus E. Rooda
2011	Misc	`conf`	Computations and Interaction. ICDCIT Jos C. M. Baeten, Bas Luttik, Paul van Tilburg
2011	J	`jnl`	Reactive Turing Machines CoRR Jos C. M. Baeten, Bas Luttik, Paul van Tilburg
2011	B	`conf`	Reactive Turing Machines. FCT Jos C. M. Baeten, Bas Luttik, Paul van Tilburg
2011	J	`jnl`	Unguardedness mostly means many solutions. Theor. Comput. Sci. Jos C. M. Baeten, Bas Luttik
2010	—	`conf`	Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) EXPRESS Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg
2009	—	`conf`	A Process-Theoretic Look at Automata. FSEN Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Luttik, P. J. A. van Tilburg
2009	J	`jnl`	Design of asynchronous supervisors CoRR Harsh Beohar, Pieter J. L. Cuijpers, Jos C. M. Baeten
2009	J	`jnl`	Preface. J. Log. Algebraic Methods Program. Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann
2008	—	`conf`	A Basic Parallel Process as a Parallel Pushdown Automaton. EXPRESS Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. van Tilburg
2008	B	`conf`	A Context-Free Process as a Pushdown Automaton. CONCUR Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. van Tilburg
2008	J	`jnl`	A ground-complete axiomatisation of finite-state processes in a generic process algebra. Math. Struct. Comput. Sci. Jos C. M. Baeten, Mario Bravetti
2008	J	`jnl`	Applying Concurrency Research in Industry Report on a Strategic Workshop. Bull. EATCS Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann
2008	—	`conf`	Calculating with Automata. Concurrency, Graphs and Models Jos C. M. Baeten
2008	J	`jnl`	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. Algebraic Methods Program. Jos C. M. Baeten, Ana Sokolova
2007	J	`jnl`	A characterization of regular expressions under bisimulation. J. ACM Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer
2007	J	`jnl`	Duplication of constants in process algebra. J. Log. Algebraic Methods Program. Jos C. M. Baeten, Michel A. Reniers
2007	J	`jnl`	Preface. Theor. Comput. Sci. Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger
2007	J	`jnl`	Preface. Theor. Comput. Sci. Jos C. M. Baeten, Iain C. C. Phillips
2007	—	`ch.`	Process Algebra. Handbook of Dynamic System Modeling Jacobus E. Rooda, D. A. van Beek, Jos C. M. Baeten
2006	B	`conf`	A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification. CONCUR Suzana Andova, Jos C. M. Baeten, Tim A. C. Willemse
2006	J	`jnl`	Guest editors' introduction: Special issue on Process Theory for Hybrid Systems. J. Log. Algebraic Methods Program. Jos C. M. Baeten, S. P. Luttik
2006	—	`conf`	Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi. LIX 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
2006	J	`jnl`	Preface. Theor. Comput. Sci. Jos C. M. Baeten, Flavio Corradini
2006	—	`ed.`	Proceedings of the 12th Workshop on Expressiveness on Concurrency, EXPRESS 2005, San Francisco, CA, USA, August 27, 2005 EXPRESS Jos C. M. Baeten, Iain Phillips
2005	—	`conf`	A Generic Process Algebra. APC 25 Jos C. M. Baeten, Mario Bravetti
2005	B	`conf`	A Ground-Complete Axiomatization of Finite State Processes in Process Algebra. CONCUR Jos C. M. Baeten, Mario Bravetti
2005	J	`jnl`	A brief history of process algebra. Theor. Comput. Sci. Jos C. M. Baeten
2005	J	`jnl`	Analyzing a J. Log. Algebraic Methods Program. 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
2005	—	`conf`	Preface. EXPRESS Jos C. M. Baeten, Iain Phillips
2005	—	`ed.`	Proceedings of the 11th International Workshop on Expressiveness in Concurrency, EXPRESS 2004, London, UK, August 30, 2004 EXPRESS Jos C. M. Baeten, Flavio Corradini
2005	A*	`conf`	Regular Expressions in Process Algebra. LICS Jos C. M. Baeten, Flavio Corradini
2005	—	`conf`	Six Themes for Future Concurrency Research. APC 25 Jos C. M. Baeten, Jan A. Bergstra
2005	—	`conf`	Timing the Untimed: Terminating Successfully While Being Conservative. Processes, Terms and Cycles Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A. Reniers
2004	J	`jnl`	Axiomatizing GSOS with termination. J. Log. Algebraic Methods Program. Jos C. M. Baeten, Erik P. de Vink
2004	—	`conf`	Preface. EXPRESS Jos C. M. Baeten, Flavio Corradini
2004	—	`conf`	Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing). SFM Jos C. M. Baeten, Michel A. Reniers
2003	A*	`ed.`	Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings ICALP Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger
2003	J	`jnl`	Embedding Untimed Into Timed Process Algebra: The Case For Explicit Termination. Math. Struct. Comput. Sci. Jos C. M. Baeten
2003	J	`jnl`	Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems. J. Log. Algebraic Methods Program. Pedro R. D'Argenio, Jos C. M. Baeten
2002	J	`jnl`	Alternative composition does not imply non-determinism. Bull. EATCS Suzana Andova, Jos C. M. Baeten
2002	A	`conf`	Axiomatizing GSOS with Termination. STACS Jos C. M. Baeten, Erik P. de Vink
2002	—	`book`	Process Algebra with Timing Jos C. M. Baeten, Cornelis A. Middelburg
2001	A	`conf`	Abstraction in Probabilistic Process Algebra. TACAS Suzana Andova, Jos C. M. Baeten
2001	—	`conf`	An MSC Based Representation of DiCons. SDL Forum Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw
2001	—	`ch.`	Partial-Order Process Algebra (and its Relation to Petri Nets). Handbook of Process Algebra Jos C. M. Baeten, Twan Basten
2001	—	`ch.`	Process Algebra with Timing: Real Time and Discrete Time. Handbook of Process Algebra Jos C. M. Baeten, Cornelis A. Middelburg
2001	J	`jnl`	Real time process algebra with time-dependent conditions. J. Log. Algebraic Methods Program. Jos C. M. Baeten, Cornelis A. Middelburg
2001	Misc	`conf`	Specifying internet applications with DiCons. SAC Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw
2001	—	`conf`	Timed Process Algebras. MTCS Jos C. M. Baeten
2000	—	`conf`	Discrete time process algebra with silent step. Proof, Language, and Interaction Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers
2000	—	`conf`	Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination. EXPRESS Jos C. M. Baeten
1999	B	`ed.`	CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings CONCUR Jos C. M. Baeten, Sjouke Mauw
1998	—	`conf`	Deadlock Behaviour in Split and ST Bisimulation Semantics. EXPRESS Jos C. M. Baeten, Jan A. Bergstra
1997	B	`conf`	Bounded Stacks, Bags and Queues. CONCUR Jos C. M. Baeten, Jan A. Bergstra
1997	J	`jnl`	Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. Fundam. Informaticae Jos C. M. Baeten, Jan A. Bergstra
1997	J	`jnl`	Process Algebra with Propositional Signals. Theor. Comput. Sci. Jos C. M. Baeten, Jan A. Bergstra
1996	J	`jnl`	Discrete Time Process Algebra. Formal Aspects Comput. Jos C. M. Baeten, Jan A. Bergstra
1996	J	`jnl`	Six Issues Concerning Future Directions in Concurrency Research. ACM Comput. Surv. Jos C. M. Baeten, Jan A. Bergstra
1995	J	`jnl`	Axiomatizing Probabilistic Processes: ACP with Generative Probabilities Inf. Comput. Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
1995	B	`conf`	Discrete Time Process Algebra with Abstraction. FCT Jos C. M. Baeten, Jan A. Bergstra
1994	—	`conf`	A Real Time Process Logic. ICTL Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol
1994	C	`conf`	Delayed choice: an operator for joining Message Sequence Charts. FORTE Jos C. M. Baeten, Sjouke Mauw
1994	J	`jnl`	On Sequential Compoisiton, Action Prefixes and Process Prefixes. Formal Aspects Comput. Jos C. M. Baeten, Jan A. Bergstra
1994	B	`conf`	Process Algebra with Partial Choice. CONCUR Jos C. M. Baeten, Jan A. Bergstra
1993	B	`conf`	A Congruence Theorem for Structured Operational Semantics with Predicates. CONCUR Jos C. M. Baeten, Chris Verhoef
1993	J	`jnl`	Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. J. ACM Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1993	B	`conf`	Non Interleaving Process Algebra. CONCUR Jos C. M. Baeten, Jan A. Bergstra
1993	J	`jnl`	Real space process algebra. Formal Aspects Comput. Jos C. M. Baeten, Jan A. Bergstra
1992	J	`jnl`	An Algebra for Process Creation. Acta Informatica Jos C. M. Baeten, Frits W. Vaandrager
1992	—	`conf`	Asynchronous Communication in Real Space Process Algebra. FTRTFT Jos C. M. Baeten, Jan A. Bergstra
1992	B	`conf`	Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). CONCUR Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
1992	B	`conf`	Discrete Time Process Algebra. CONCUR Jos C. M. Baeten, Jan A. Bergstra
1992	—	`conf`	The Total Order Assumption. NAPAW Jos C. M. Baeten
1991	B	`ed.`	CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings CONCUR Jos C. M. Baeten, Jan Friso Groote
1991	B	`conf`	Real Space Process Algebra. CONCUR Jos C. M. Baeten, Jan A. Bergstra
1991	J	`jnl`	Real Time Process Algebra. Formal Aspects Comput. Jos C. M. Baeten, Jan A. Bergstra
1991	J	`jnl`	Recursive Process Definitions with the State Operator. Theor. Comput. Sci. Jos C. M. Baeten, Jan A. Bergstra
1991	—	`conf`	The State Operator in Real Time Process Algebra. REX Workshop Jos C. M. Baeten, Jan A. Bergstra
1990	B	`ed.`	CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27-30, 1990, Proceedings CONCUR Jos C. M. Baeten, Jan Willem Klop
1990	B	`conf`	Process Algebra with a Zero Object. CONCUR Jos C. M. Baeten, Jan A. Bergstra
1990	—	`book`	Process algebra. Jos C. M. Baeten, W. P. Weijland
1989	—	`conf`	A Process Specification Formalism Based on Static COLD. Algebraic Methods Jos C. M. Baeten, Jan A. Bergstra, Sjouke Mauw, Gert J. Veltink
1989	—	`conf`	Design of a Specification Language by Abstract Syntax Engineering. Algebraic Methods Jos C. M. Baeten, Jan A. Bergstra
1989	J	`jnl`	Term-Rewriting Systems with Rule Priorities. Theor. Comput. Sci. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland
1988	J	`jnl`	Global Renaming Operators in Concrete Process Algebra Inf. Comput. Jos C. M. Baeten, Jan A. Bergstra
1987	A*	`conf`	Another Look at Abstraction in Process Algebra (Extended Abstract). ICALP Jos C. M. Baeten, Rob J. van Glabbeek
1987	—	`conf`	Conditional axioms and α/β-calculus in process algebra. Formal Description of Programming Concepts Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987	—	`conf`	Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. PARLE (2) Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987	—	`conf`	Merge and Termination in Process Algebra. FSTTCS Jos C. M. Baeten, Rob J. van Glabbeek
1987	J	`jnl`	On the Consistency of Koomen's Fair Abstraction Rule. Theor. Comput. Sci. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987	J	`jnl`	Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. Comput. J. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987	—	`conf`	Semantics for Prolog via Term Rewrite Systems. CTRS Jos C. M. Baeten, W. P. Weijland
1987	—	`conf`	Term Rewriting Systems with Priorities. RTA Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop