The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jos C. M. Baeten: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jos C. M. Baeten, Jan A. Bergstra
    Real Time Process Algebra. [Citation Graph (1, 0)][DBLP]
    Formal Asp. Comput., 1991, v:3, n:2, pp:142-188 [Journal]
  2. Jos C. M. Baeten, Jan A. Bergstra, Sjouke Mauw, Gert J. Veltink
    A Process Specification Formalism Based on Static COLD. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods, 1989, pp:303-335 [Conf]
  3. Jos C. M. Baeten, Jan A. Bergstra
    Design of a Specification Language by Abstract Syntax Engineering. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods, 1989, pp:363-394 [Conf]
  4. Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A. Reniers
    Timing the Untimed: Terminating Successfully While Being Conservative. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:251-279 [Conf]
  5. Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
    Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:472-485 [Conf]
  6. Jos C. M. Baeten, Jan A. Bergstra
    Bounded Stacks, Bags and Queues. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1997, pp:104-118 [Conf]
  7. Jos C. M. Baeten, Chris Verhoef
    A Congruence Theorem for Structured Operational Semantics with Predicates. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:477-492 [Conf]
  8. Jos C. M. Baeten, Jan A. Bergstra
    Non Interleaving Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:308-323 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:327-342 [Conf]
  10. Jos C. M. Baeten, Mario Bravetti
    A Ground-Complete Axiomatization of Finite State Processes in Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:248-262 [Conf]
  11. Jos C. M. Baeten, Jan A. Bergstra
    Process Algebra with a Zero Object. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:83-98 [Conf]
  12. Jos C. M. Baeten, Jan A. Bergstra
    Real Space Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:96-110 [Conf]
  13. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:401-420 [Conf]
  14. Jos C. M. Baeten, Jan A. Bergstra
    Process Algebra with Partial Choice. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1994, pp:465-480 [Conf]
  15. Jos C. M. Baeten, W. P. Weijland
    Semantics for Prolog via Term Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:3-14 [Conf]
  16. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra with Abstraction. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:1-15 [Conf]
  17. Jos C. M. Baeten, Sjouke Mauw
    Delayed choice: an operator for joining Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    FORTE, 1994, pp:340-354 [Conf]
  18. Jos C. M. Baeten, Rob J. van Glabbeek
    Merge and Termination in Process Algebra. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:153-172 [Conf]
  19. Jos C. M. Baeten, Jan A. Bergstra
    Asynchronous Communication in Real Space Process Algebra. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1992, pp:473-492 [Conf]
  20. Jos C. M. Baeten, Rob J. van Glabbeek
    Another Look at Abstraction in Process Algebra (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:84-94 [Conf]
  21. Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol
    A Real Time Process Logic. [Citation Graph (0, 0)][DBLP]
    ICTL, 1994, pp:30-47 [Conf]
  22. Jos C. M. Baeten, Flavio Corradini
    Regular Expressions in Process Algebra. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:12-19 [Conf]
  23. Jos C. M. Baeten
    The Total Order Assumption. [Citation Graph (0, 0)][DBLP]
    NAPAW, 1992, pp:231-240 [Conf]
  24. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1987, pp:94-111 [Conf]
  25. Jos C. M. Baeten, Jan A. Bergstra
    The State Operator in Real Time Process Algebra. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1991, pp:107-123 [Conf]
  26. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Term Rewriting Systems with Priorities. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:83-94 [Conf]
  27. Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw
    Specifying internet applications with DiCons. [Citation Graph (0, 0)][DBLP]
    SAC, 2001, pp:576-584 [Conf]
  28. Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw
    An MSC Based Representation of DiCons. [Citation Graph (0, 0)][DBLP]
    SDL Forum, 2001, pp:328-347 [Conf]
  29. Jos C. M. Baeten, Michel A. Reniers
    Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing). [Citation Graph (0, 0)][DBLP]
    SFM, 2004, pp:59-97 [Conf]
  30. Jos C. M. Baeten, Erik P. de Vink
    Axiomatizing GSOS with Termination. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:583-595 [Conf]
  31. Suzana Andova, Jos C. M. Baeten
    Abstraction in Probabilistic Process Algebra. [Citation Graph (0, 0)][DBLP]
    TACAS, 2001, pp:204-219 [Conf]
  32. Jos C. M. Baeten, Frits W. Vaandrager
    An Algebra for Process Creation. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:4, pp:303-334 [Journal]
  33. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:6, pp:498-506 [Journal]
  34. Jos C. M. Baeten, Jan A. Bergstra
    Six Issues Concerning Future Directions in Concurrency Research. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:39- [Journal]
  35. Suzana Andova, Jos C. M. Baeten
    Alternative composition does not imply non-determinism. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:76, n:, pp:125-127 [Journal]
  36. Jos C. M. Baeten
    Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:39, n:1, pp:- [Journal]
  37. Jos C. M. Baeten
    Timed Process Algebras. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:52, n:3, pp:- [Journal]
  38. Jos C. M. Baeten, Jan A. Bergstra
    Deadlock Behaviour in Split and ST Bisimulation Semantics. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:2, pp:- [Journal]
  39. Jos C. M. Baeten, Flavio Corradini
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:2, pp:1-3 [Journal]
  40. Jos C. M. Baeten, Iain Phillips
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:154, n:3, pp:1-2 [Journal]
  41. Jos C. M. Baeten, Mario Bravetti
    A Generic Process Algebra. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:65-71 [Journal]
  42. Jos C. M. Baeten, Jan A. Bergstra
    Six Themes for Future Concurrency Research. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:61-64 [Journal]
  43. Jos C. M. Baeten, Jan A. Bergstra
    On Sequential Compoisiton, Action Prefixes and Process Prefixes. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1994, v:6, n:3, pp:250-268 [Journal]
  44. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1996, v:8, n:2, pp:188-208 [Journal]
  45. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:29, n:1-2, pp:51-76 [Journal]
  46. Jos C. M. Baeten, Jan A. Bergstra
    Global Renaming Operators in Concrete Process Algebra [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:3, pp:205-245 [Journal]
  47. Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
    Axiomatizing Probabilistic Processes: ACP with Generative Probabilities [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:2, pp:234-255 [Journal]
  48. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:3, pp:653-682 [Journal]
  49. Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer
    A characterization of regular expressions under bisimulation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:2, pp:- [Journal]
  50. E. 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. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:65, n:2, pp:51-104 [Journal]
  51. Jos C. M. Baeten, S. P. Luttik
    Guest editors' introduction: Special issue on Process Theory for Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2006, v:68, n:1-2, pp:1-3 [Journal]
  52. Jos C. M. Baeten, C. A. Middelburg
    Real time process algebra with time-dependent conditions. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2001, v:48, n:1-2, pp:1-38 [Journal]
  53. Jos C. M. Baeten, Erik P. de Vink
    Axiomatizing GSOS with termination. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2004, v:60, n:, pp:323-351 [Journal]
  54. Pedro R. D'Argenio, Jos C. M. Baeten
    Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2003, v:56, n:1-2, pp:1-2 [Journal]
  55. Jos C. M. Baeten
    Embedding Untimed Into Timed Process Algebra: The Case For Explicit Termination. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:4, pp:589-618 [Journal]
  56. Jos C. M. Baeten
    A brief history of process algebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:2-3, pp:131-146 [Journal]
  57. Jos C. M. Baeten, Jan A. Bergstra
    Recursive Process Definitions with the State Operator. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:2, pp:285-302 [Journal]
  58. Jos C. M. Baeten, Jan A. Bergstra
    Process Algebra with Propositional Signals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:177, n:2, pp:381-405 [Journal]
  59. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    On the Consistency of Koomen's Fair Abstraction Rule. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:129-176 [Journal]
  60. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland
    Term-Rewriting Systems with Rule Priorities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:283-301 [Journal]
  61. Jos C. M. Baeten, Flavio Corradini
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:3, pp:263-264 [Journal]
  62. Jos C. M. Baeten, Michel A. Reniers
    Duplication of constants in process algebra. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:70, n:2, pp:151-171 [Journal]
  63. Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:305- [Journal]

  64. Discrete time process algebra with silent step. [Citation Graph (, )][DBLP]


  65. Calculating with Automata. [Citation Graph (, )][DBLP]


  66. A Context-Free Process as a Pushdown Automaton. [Citation Graph (, )][DBLP]


  67. A Process-Theoretic Look at Automata. [Citation Graph (, )][DBLP]


  68. Design of asynchronous supervisors [Citation Graph (, )][DBLP]


  69. Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi. [Citation Graph (, )][DBLP]


  70. A Basic Parallel Process as a Parallel Pushdown Automaton. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.459secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002