The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rob J. van Glabbeek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rob J. van Glabbeek, Frits W. Vaandrager
    Modular Specifications in Process Algebra with Curious Queues. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods, 1987, pp:465-506 [Conf]
  2. Rob J. van Glabbeek
    Full Abstraction in Structural Operational Semantics (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    AMAST, 1993, pp:75-82 [Conf]
  3. Rob J. van Glabbeek, Peter Rittgen
    Scheduling Algebra. [Citation Graph (0, 0)][DBLP]
    AMAST, 1998, pp:278-292 [Conf]
  4. Ingo Czaja, Rob J. van Glabbeek, Ursula Goltz
    Interleaving semantics and action refinement with atomic choice. [Citation Graph (0, 0)][DBLP]
    Advances in Petri Nets: The DEMON Project, 1992, pp:89-107 [Conf]
  5. David G. Stork, Rob J. van Glabbeek
    Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2002, pp:394-413 [Conf]
  6. Rob J. van Glabbeek
    A Characterisation of Weak Bisimulation Congruence. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:26-39 [Conf]
  7. Rob J. van Glabbeek, David G. Stork
    Query Nets: Interacting Workflow Modules That Ensure Global Termination. [Citation Graph (0, 0)][DBLP]
    Business Process Management, 2003, pp:184-199 [Conf]
  8. Rob J. van Glabbeek
    The Individual and Collective Token Interpretations of Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:323-337 [Conf]
  9. Rob J. van Glabbeek
    The Linear Time-Branching Time Spectrum (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:278-297 [Conf]
  10. Rob J. van Glabbeek
    The Linear Time - Branching Time Spectrum II. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:66-81 [Conf]
  11. Rob J. van Glabbeek
    Axiomatizing Flat Iteration. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1997, pp:228-242 [Conf]
  12. Rob J. van Glabbeek
    Petri Nets, Configuration Structures and Higher Dimensional Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:21-27 [Conf]
  13. Rob J. van Glabbeek, Frits W. Vaandrager
    Bundle Event Structures and CCSP. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:57-71 [Conf]
  14. Rob J. van Glabbeek, Marc Voorhoeve
    Liveness, Fairness and Impossible Futures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:126-141 [Conf]
  15. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:412-422 [Conf]
  16. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. [Citation Graph (0, 0)][DBLP]
    FMCO, 2005, pp:195-218 [Conf]
  17. 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]
  18. 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]
  19. Rob J. van Glabbeek
    The Meaning of Negative Premises in Transition System Specifications II. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:502-513 [Conf]
  20. Rob J. van Glabbeek
    On Cool Congruence Formats for Weak Bisimulations. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2005, pp:318-333 [Conf]
  21. Rob J. van Glabbeek, W. P. Weijland
    Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:613-618 [Conf]
  22. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence Formats for Decorated Trace Preorders. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:107-118 [Conf]
  23. Rob J. van Glabbeek, Gordon D. Plotkin
    Configuration Structures [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:199-209 [Conf]
  24. Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen, Chris M. N. Tofts
    Reactive, Generative, and Stratified Models of Probabilistic Processes [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:130-141 [Conf]
  25. Dominic J. D. Hughes, Rob J. van Glabbeek
    Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract). [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:1-10 [Conf]
  26. Rob J. van Glabbeek, Ursula Goltz
    Equivalences and Refinement. [Citation Graph (0, 0)][DBLP]
    Semantics of Systems of Concurrent Processes, 1990, pp:309-333 [Conf]
  27. Rob J. van Glabbeek
    A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:473-484 [Conf]
  28. Rob J. van Glabbeek, Ursula Goltz
    Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:237-248 [Conf]
  29. Rob J. van Glabbeek, Gordon D. Plotkin
    Event Structures for Resolvable Conflict. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:550-561 [Conf]
  30. Rob J. van Glabbeek, Frits W. Vaandrager
    Petri Net Models for Algebraic Theories of Concurrency. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1987, pp:224-242 [Conf]
  31. Nadia Busi, Rob J. van Glabbeek, Roberto Gorrieri
    Axiomatising ST-Bisimulation Equivalence. [Citation Graph (0, 0)][DBLP]
    PROCOMET, 1994, pp:169-188 [Conf]
  32. Rob J. van Glabbeek, Ursula Goltz
    Refinement of Actions in Causality Based Models. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1989, pp:267-300 [Conf]
  33. Rob J. van Glabbeek
    Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:336-347 [Conf]
  34. Rob J. van Glabbeek, Ursula Goltz
    Refinement of actions and equivalence notions for concurrent systems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2001, v:37, n:4/5, pp:229-327 [Journal]
  35. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence Formats for Decorated Trace Semantics [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  36. Rob J. van Glabbeek
    Axiomatizing Flat Iteration [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  37. Rob J. van Glabbeek
    What is Branching time semantics and why to use it? [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1994, v:53, n:, pp:191-198 [Journal]
  38. Rob J. van Glabbeek, Ursula Goltz
    Parial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:38, n:, pp:154-163 [Journal]
  39. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Divide and Congruence Applied to eta-Bisimulation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:156, n:1, pp:97-113 [Journal]
  40. Rob J. van Glabbeek
    On the Expressiveness of Higher Dimensional Automata: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:2, pp:5-34 [Journal]
  41. Rob J. van Glabbeek
    On Specifying Timeouts. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:173-175 [Journal]
  42. Rob J. van Glabbeek, Peter D. Mosses
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:175, n:1, pp:1-2 [Journal]
  43. Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
    Remarks on Testing Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:359-397 [Journal]
  44. Luca Aceto, Wan Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir
    Nested semantics over finite trees are equationally hard. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:191, n:2, pp:203-232 [Journal]
  45. Luca Aceto, Rob J. van Glabbeek, Wan Fokkink, Anna Ingólfsdóttir
    Axiomatizing Prefix Iteration with Silent Steps. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:127, n:1, pp:26-40 [Journal]
  46. Wan Fokkink, Rob J. van Glabbeek
    Ntyft/Ntyxt Rules Reduce to Ntree Rules. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:126, n:1, pp:1-10 [Journal]
  47. Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen
    Reactive, Generative and Stratified Models of Probabilistic Processes [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:1, pp:59-80 [Journal]
  48. Rob J. van Glabbeek, Frits W. Vaandrager
    The Difference between Splitting in n and n+1. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:136, n:2, pp:109-142 [Journal]
  49. Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek
    Preface. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:156, n:1-2, pp:1- [Journal]
  50. Rob J. van Glabbeek, W. P. Weijland
    Branching Time and Abstraction in Bisimulation Semantics. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:3, pp:555-600 [Journal]
  51. Rob J. van Glabbeek
    The meaning of negative premises in transition system specifications II. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2004, v:60, n:, pp:229-258 [Journal]
  52. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Compositionality of Hennessy-Milner logic by structural operational semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:421-440 [Journal]
  53. Rob J. van Glabbeek
    On the expressiveness of higher dimensional automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:3, pp:265-290 [Journal]
  54. Rob J. van Glabbeek
    Notes on the Methodology of CCS and CSP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:177, n:2, pp:329-349 [Journal]
  55. Rob J. van Glabbeek, Ursula Goltz
    Well-behaved flow event structures for parallel composition and action refinement. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:311, n:1-3, pp:463-478 [Journal]
  56. Rob J. van Glabbeek, Frits W. Vaandrager
    Modular Specification of Process Algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:113, n:2, pp:293-348 [Journal]
  57. Rob J. van Glabbeek
    Erratum to "On the expressiveness of higher dimensional automata": [TCS 356 (2006) 265-290]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:368, n:1-2, pp:168-194 [Journal]
  58. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence formats for decorated trace semantics. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:1, pp:26-78 [Journal]
  59. Dominic J. D. Hughes, Rob J. van Glabbeek
    Proof nets for unit-free multiplicative-additive linear logic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:4, pp:784-842 [Journal]
  60. Yuxin Deng, Rob J. van Glabbeek, Carroll Morgan, Chenyi Zhang
    Scalar Outcomes Suffice for Finitary Probabilistic Testing. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:363-378 [Conf]
  61. Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
    Characterising Testing Preorders for Finite Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:313-325 [Conf]

  62. Correcting a Space-Efficient Simulation Algorithm. [Citation Graph (, )][DBLP]


  63. Testing Finitary Probabilistic Processes. [Citation Graph (, )][DBLP]


  64. On Synchronous and Asynchronous Interaction in Distributed Systems. [Citation Graph (, )][DBLP]


  65. On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. [Citation Graph (, )][DBLP]


  66. Five Determinisation Algorithms. [Citation Graph (, )][DBLP]


  67. Characterising Testing Preorders for Finite Probabilistic Processes [Citation Graph (, )][DBLP]


  68. On Finite Bases for Weak Semantics: Failures versus Impossible Futures [Citation Graph (, )][DBLP]


  69. On Synchronous and Asynchronous Interaction in Distributed Systems [Citation Graph (, )][DBLP]


  70. Branching Bisimilarity with Explicit Divergence [Citation Graph (, )][DBLP]


  71. Symmetric and Asymmetric Asynchronous Interaction [Citation Graph (, )][DBLP]


  72. Computation Tree Logic with Deadlock Detection [Citation Graph (, )][DBLP]


  73. Configuration Structures, Event Structures and Petri Nets [Citation Graph (, )][DBLP]


  74. Characterising Probabilistic Processes Logically [Citation Graph (, )][DBLP]


  75. On CSP and the Algebraic Theory of Effects [Citation Graph (, )][DBLP]


  76. The Coarsest Precongruences Respecting Safety and Liveness Properties [Citation Graph (, )][DBLP]


  77. Preface. [Citation Graph (, )][DBLP]


  78. Symmetric and Asymmetric Asynchronous Interaction. [Citation Graph (, )][DBLP]


Search in 3.489secs, Finished in 3.491secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002