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