default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJos C. M. Baeten
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c57]Jos C. M. Baeten, Bas Luttik:
Sequential Value Passing Yields a Kleene Theorem for Processes. Logics and Type Systems in Theory and Practice 2024: 1-16- 2023
- [j38]Jos C. M. Baeten, Cesare Carissimo, Bas Luttik:
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. Log. Methods Comput. Sci. 19(1) (2023) - [c56]Jos C. M. Baeten, Bas Luttik:
Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract). EXPRESS/SOS 2023: 114-131 - 2022
- [i5]Jos C. M. Baeten, Cesare Carissimo, Bas Luttik:
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. CoRR abs/2203.01713 (2022) - 2021
- [c55]Jos C. M. Baeten, Cesare Carissimo, Bas Luttik:
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. CALCO 2021: 8:1-8:16 - 2020
- [c54]Luca Aceto
, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva:
CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). CONCUR 2020: 5:1-5:3
2010 – 2019
- 2019
- [c53]Astrid Belder, Bas Luttik, Jos C. M. Baeten:
Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity. CALCO 2019: 11:1-11:22 - 2017
- [c52]Jos C. M. Baeten, Bas Luttik, Fei Yang:
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract). EXPRESS/SOS 2017: 1-17 - [i4]Jos C. M. Baeten, Bas Luttik, Fei Yang:
Sequential Composition in the Presence of Intermediate Termination. CoRR abs/1706.08401 (2017) - 2016
- [j37]Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg:
Expressiveness modulo bisimilarity of regular expressions with parallel composition. Math. Struct. Comput. Sci. 26(6): 933-968 (2016) - 2015
- [j36]Jos C. M. Baeten, Jasen Markovski:
The role of supervisory controller synthesis in automatic control software development. Sci. Comput. Program. 97: 17-22 (2015) - 2014
- [r2]Jos C. M. Baeten, Davide Sangiorgi:
Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi. Computational Logic 2014: 399-442 - 2013
- [j35]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Reactive Turing machines. Inf. Comput. 231: 143-166 (2013) - 2012
- [j34]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 Aspects Comput. 24(4-6): 497-518 (2012) - [c51]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Turing Meets Milner. CONCUR 2012: 1-20 - [c50]Jasen Markovski, Dirk A. van Beek, Jos C. M. Baeten:
Partially-Supervised Plants: Embedding Control Requirements in Plant Components. IFM 2012: 253-267 - [e7]Jos C. M. Baeten, Thomas Ball, Frank S. de Boer:
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 [contents] - [i3]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
When Turing Meets Milner. ERCIM News 2012(91) (2012) - 2011
- [j33]Jos C. M. Baeten, Bas Luttik:
Unguardedness mostly means many solutions. Theor. Comput. Sci. 412(28): 3090-3100 (2011) - [c49]Jos C. M. Baeten, D. A. van Beek, Bas Luttik, Jasen Markovski, Jacobus E. Rooda:
A process-theoretic approach to supervisory control theory. ACC 2011: 4496-4501 - [c48]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Reactive Turing Machines. FCT 2011: 348-359 - [c47]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Computations and Interaction. ICDCIT 2011: 35-54 - [c46]Jos C. M. Baeten, Bert van Beek, Allan van Hulst, Jasen Markovski:
A Process Algebra for Supervisory Coordination. PACO 2011: 36-55 - [i2]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Reactive Turing Machines. CoRR abs/1104.1738 (2011) - 2010
- [c45]Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg:
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract). EXPRESS 2010: 1-15
2000 – 2009
- 2009
- [j32]Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann:
Preface. J. Log. Algebraic Methods Program. 78(4) (2009) - [c44]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 - [i1]Harsh Beohar, Pieter J. L. Cuijpers, Jos C. M. Baeten:
Design of asynchronous supervisors. CoRR abs/0910.0868 (2009) - 2008
- [j31]Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann:
Applying Concurrency Research in Industry Report on a Strategic Workshop. Bull. EATCS 94: 113-129 (2008) - [j30]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. Algebraic Methods Program. 78(1): 52 (2008) - [j29]Jos C. M. Baeten, Mario Bravetti:
A ground-complete axiomatisation of finite-state processes in a generic process algebra. Math. Struct. Comput. Sci. 18(6): 1057-1089 (2008) - [c43]Jos C. M. Baeten:
Calculating with Automata. Concurrency, Graphs and Models 2008: 747-756 - [c42]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 - [c41]Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. van Tilburg:
A Basic Parallel Process as a Parallel Pushdown Automaton. EXPRESS 2008: 35-48 - 2007
- [j28]Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer:
A characterization of regular expressions under bisimulation. J. ACM 54(2): 6 (2007) - [j27]Jos C. M. Baeten, Michel A. Reniers:
Duplication of constants in process algebra. J. Log. Algebraic Methods Program. 70(2): 151-171 (2007) - [j26]Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger:
Preface. Theor. Comput. Sci. 379(3): 305 (2007) - [j25]Jos C. M. Baeten, Iain C. C. Phillips:
Preface. Theor. Comput. Sci. 386(3): 167-168 (2007) - [r1]Jacobus E. Rooda, D. A. van Beek, Jos C. M. Baeten:
Process Algebra. Handbook of Dynamic System Modeling 2007 - 2006
- [j24]Jos C. M. Baeten, S. P. Luttik:
Guest editors' introduction: Special issue on Process Theory for Hybrid Systems. J. Log. Algebraic Methods Program. 68(1-2): 1-3 (2006) - [j23]Jos C. M. Baeten, Flavio Corradini:
Preface. Theor. Comput. Sci. 356(3): 263-264 (2006) - [c40]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 - [c39]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:
Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi. LIX 2006: 21-53 - [e6]Jos C. M. Baeten, Iain C. C. Phillips:
Proceedings of the 12th Workshop on Expressiveness on Concurrency, EXPRESS 2005, San Francisco, CA, USA, August 27, 2005. Electronic Notes in Theoretical Computer Science 154(3), Elsevier 2006 [contents] - 2005
- [j22]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:
Analyzing a chi model of a turntable system using Spin, CADP and Uppaal. J. Log. Algebraic Methods Program. 65(2): 51-104 (2005) - [j21]Jos C. M. Baeten:
A brief history of process algebra. Theor. Comput. Sci. 335(2-3): 131-146 (2005) - [c38]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 - [c37]Jos C. M. Baeten, Mario Bravetti:
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra. CONCUR 2005: 248-262 - [c36]Jos C. M. Baeten, Flavio Corradini:
Regular Expressions in Process Algebra. LICS 2005: 12-19 - [c35]Jos C. M. Baeten, Iain C. C. Phillips:
Preface. EXPRESS 2005: 1-2 - [c34]Jos C. M. Baeten, Jan A. Bergstra:
Six Themes for Future Concurrency Research. APC 25 2005: 61-64 - [c33]Jos C. M. Baeten, Mario Bravetti:
A Generic Process Algebra. APC 25 2005: 65-71 - [e5]Jos C. M. Baeten, Flavio Corradini:
Proceedings of the 11th International Workshop on Expressiveness in Concurrency, EXPRESS 2004, London, UK, August 30, 2004. Electronic Notes in Theoretical Computer Science 128(2), Elsevier 2005 [contents] - 2004
- [j20]Jos C. M. Baeten, Erik P. de Vink:
Axiomatizing GSOS with termination. J. Log. Algebraic Methods Program. 60-61: 323-351 (2004) - [c32]Jos C. M. Baeten, Michel A. Reniers:
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing). SFM 2004: 59-97 - [c31]Jos C. M. Baeten, Flavio Corradini:
Preface. EXPRESS 2004: 1-3 - 2003
- [j19]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. Algebraic Methods Program. 56(1-2): 1-2 (2003) - [j18]Jos C. M. Baeten:
Embedding Untimed Into Timed Process Algebra: The Case For Explicit Termination. Math. Struct. Comput. Sci. 13(4): 589-618 (2003) - [e4]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. Lecture Notes in Computer Science 2719, Springer 2003, ISBN 3-540-40493-7 [contents] - 2002
- [b2]Jos C. M. Baeten, Cornelis A. Middelburg:
Process Algebra with Timing. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2002, ISBN 978-3-642-07788-3, pp. I-XIX, 1-290 - [j17]Suzana Andova, Jos C. M. Baeten:
Alternative composition does not imply non-determinism. Bull. EATCS 76: 125-127 (2002) - [c30]Jos C. M. Baeten, Erik P. de Vink:
Axiomatizing GSOS with Termination. STACS 2002: 583-595 - 2001
- [j16]Jos C. M. Baeten, Cornelis A. Middelburg:
Real time process algebra with time-dependent conditions. J. Log. Algebraic Methods Program. 48(1-2): 1-38 (2001) - [c29]Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw:
Specifying internet applications with DiCons. SAC 2001: 576-584 - [c28]Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw:
An MSC Based Representation of DiCons. SDL Forum 2001: 328-347 - [c27]Suzana Andova, Jos C. M. Baeten:
Abstraction in Probabilistic Process Algebra. TACAS 2001: 204-219 - [c26]Jos C. M. Baeten:
Timed Process Algebras. MTCS 2001: 207-208 - [p2]Jos C. M. Baeten, Cornelis A. Middelburg:
Process Algebra with Timing: Real Time and Discrete Time. Handbook of Process Algebra 2001: 627-684 - [p1]Jos C. M. Baeten, Twan Basten:
Partial-Order Process Algebra (and its Relation to Petri Nets). Handbook of Process Algebra 2001: 769-872 - 2000
- [c25]Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers:
Discrete time process algebra with silent step. Proof, Language, and Interaction 2000: 535-570 - [c24]Jos C. M. Baeten:
Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination. EXPRESS 2000: 3-20
1990 – 1999
- 1999
- [e3]Jos C. M. Baeten, Sjouke Mauw:
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 [contents] - 1998
- [c23]Jos C. M. Baeten, Jan A. Bergstra:
Deadlock Behaviour in Split and ST Bisimulation Semantics. EXPRESS 1998: 61-74 - 1997
- [j15]Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. Fundam. Informaticae 29(1-2): 51-76 (1997) - [j14]Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with Propositional Signals. Theor. Comput. Sci. 177(2): 381-405 (1997) - [c22]Jos C. M. Baeten, Jan A. Bergstra:
Bounded Stacks, Bags and Queues. CONCUR 1997: 104-118 - 1996
- [j13]Jos C. M. Baeten, Jan A. Bergstra:
Six Issues Concerning Future Directions in Concurrency Research. ACM Comput. Surv. 28(4es): 39 (1996) - [j12]Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra. Formal Aspects Comput. 8(2): 188-208 (1996) - 1995
- [j11]Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka:
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities. Inf. Comput. 121(2): 234-255 (1995) - [c21]Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra with Abstraction. FCT 1995: 1-15 - 1994
- [j10]Jos C. M. Baeten, Jan A. Bergstra:
On Sequential Compoisiton, Action Prefixes and Process Prefixes. Formal Aspects Comput. 6(3): 250-268 (1994) - [c20]Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with Partial Choice. CONCUR 1994: 465-480 - [c19]Jos C. M. Baeten, Sjouke Mauw:
Delayed choice: an operator for joining Message Sequence Charts. FORTE 1994: 340-354 - [c18]Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol:
A Real Time Process Logic. ICTL 1994: 30-47 - 1993
- [j9]Jos C. M. Baeten, Jan A. Bergstra:
Real space process algebra. Formal Aspects Comput. 5(6): 481-529 (1993) - [j8]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) - [c17]Jos C. M. Baeten, Jan A. Bergstra:
Non Interleaving Process Algebra. CONCUR 1993: 308-323 - [c16]Jos C. M. Baeten, Chris Verhoef:
A Congruence Theorem for Structured Operational Semantics with Predicates. CONCUR 1993: 477-492 - 1992
- [j7]Jos C. M. Baeten, Frits W. Vaandrager:
An Algebra for Process Creation. Acta Informatica 29(4): 303-334 (1992) - [c15]Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra. CONCUR 1992: 401-420 - [c14]Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka:
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). CONCUR 1992: 472-485 - [c13]Jos C. M. Baeten, Jan A. Bergstra:
Asynchronous Communication in Real Space Process Algebra. FTRTFT 1992: 473-492 - [c12]Jos C. M. Baeten:
The Total Order Assumption. NAPAW 1992: 231-240 - 1991
- [j6]Jos C. M. Baeten, Jan A. Bergstra:
Real Time Process Algebra. Formal Aspects Comput. 3(2): 142-188 (1991) - [j5]Jos C. M. Baeten, Jan A. Bergstra:
Recursive Process Definitions with the State Operator. Theor. Comput. Sci. 82(2): 285-302 (1991) - [c11]Jos C. M. Baeten, Jan A. Bergstra:
Real Space Process Algebra. CONCUR 1991: 96-110 - [c10]Jos C. M. Baeten, Jan A. Bergstra:
The State Operator in Real Time Process Algebra. REX Workshop 1991: 107-123 - [e2]Jos C. M. Baeten, Jan Friso Groote:
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 [contents] - 1990
- [b1]Jos C. M. Baeten, W. P. Weijland:
Process algebra. Cambridge tracts in theoretical computer science 18, Cambridge University Press 1990, ISBN 978-0-521-40043-5, pp. 1-248 - [c9]Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with a Zero Object. CONCUR 1990: 83-98 - [e1]Jos C. M. Baeten, Jan Willem Klop:
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 [contents]
1980 – 1989
- 1989
- [j4]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) - [c8]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 - [c7]Jos C. M. Baeten, Jan A. Bergstra:
Design of a Specification Language by Abstract Syntax Engineering. Algebraic Methods 1989: 363-394 - 1988
- [j3]Jos C. M. Baeten, Jan A. Bergstra:
Global Renaming Operators in Concrete Process Algebra. Inf. Comput. 78(3): 205-245 (1988) - 1987
- [j2]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) - [j1]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) - [c6]Jos C. M. Baeten, W. P. Weijland:
Semantics for Prolog via Term Rewrite Systems. CTRS 1987: 3-14 - [c5]Jos C. M. Baeten, Rob J. van Glabbeek:
Merge and Termination in Process Algebra. FSTTCS 1987: 153-172 - [c4]Jos C. M. Baeten, Rob J. van Glabbeek:
Another Look at Abstraction in Process Algebra (Extended Abstract). ICALP 1987: 84-94 - [c3]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Conditional axioms and α/β-calculus in process algebra. Formal Description of Programming Concepts 1987: 53-76 - [c2]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 - [c1]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Term Rewriting Systems with Priorities. RTA 1987: 83-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
