Rob J. van Glabbeek

153 papers A* 10A 8B 22C 2Journal 75Unranked 30

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The Similarity Control Problem with Required Events. CoRR Yu Wang, Zhaohui Zhu, Rob J. van Glabbeek, Jinjin Zhang, Yixuan Li
2024	B	`conf`	Branching Bisimilarity for Processes with Time-Outs. CONCUR Gaspard Reghem, Rob J. van Glabbeek
2020	J	`jnl`	On infinite guarded recursive specifications in process algebra. CoRR Rob J. van Glabbeek, Cornelis A. Middelburg
2019	—	`conf`	A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract). The Art of Modelling Computational Systems Rob J. van Glabbeek, Jan Friso Groote, Erik P. de Vink
2018	B	`conf`	Analysing AWN-Specifications Using mCRL2 (Extended Abstract). IFM Rob J. van Glabbeek, Peter Höfner, Djurre van der Wal
2018	J	`jnl`	On the validity of encodings of the synchronous in the asynchronous Inf. Process. Lett. Rob J. van Glabbeek
2018	J	`jnl`	Rooted Divergence-Preserving Branching Bisimilarity is a Congruence. CoRR Rob J. van Glabbeek, Bas Luttik, Linda Spaninks
2017	—	`conf`	A Branching Time Model of CSP. Concurrency, Security, and Puzzles Rob J. van Glabbeek
2017	J	`jnl`	A Branching Time Model of CSP. CoRR Rob J. van Glabbeek
2017	J	`jnl`	An Algebraic Treatment of Recursion. CoRR Rob J. van Glabbeek
2017	—	`conf`	Analysing Mutual Exclusion using Process Algebra with Signals. EXPRESS/SOS Victor Dyseryn, Rob J. van Glabbeek, Peter Höfner
2017	B	`conf`	Divide and Congruence III: Stability & Divergence. CONCUR Wan J. Fokkink, Rob J. van Glabbeek, Bas Luttik
2017	J	`jnl`	Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity. Inf. Comput. Wan J. Fokkink, Rob J. van Glabbeek
2017	J	`jnl`	Ensuring Liveness Properties of Distributed Systems (A Research Agenda). CoRR Rob J. van Glabbeek
2017	J	`jnl`	Lean and Full Congruence Formats for Recursion. CoRR Rob J. van Glabbeek
2017	A*	`conf`	Lean and full congruence formats for recursion. LICS Rob J. van Glabbeek
2017	B	`conf`	Precongruence Formats with Lookahead through Modal Decomposition. CSL Wan J. Fokkink, Rob J. van Glabbeek
2017	—	`conf`	Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack. MARS Rob J. van Glabbeek, Peter Höfner
2016	A	`conf`	A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract). ESOP Emile Bres, Rob J. van Glabbeek, Peter Höfner
2016	J	`jnl`	A Timed Process Algebra for Wireless Networks. CoRR Emile Bres, Rob J. van Glabbeek, Peter Höfner
2016	A*	`conf`	Divide and Congruence II: Delay and Weak Bisimilarity. LICS Wan J. Fokkink, Rob J. van Glabbeek
2016	J	`jnl`	Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity. CoRR Wan J. Fokkink, Rob J. van Glabbeek
2016	J	`jnl`	MALL proof nets identify proofs modulo rule commutation. CoRR Rob J. van Glabbeek, Dominic J. D. Hughes
2016	J	`jnl`	Mechanizing a Process Algebra for Network Protocols. J. Autom. Reason. Timothy Bourke, Rob J. van Glabbeek, Peter Höfner
2016	J	`jnl`	Modelling and verifying the AODV routing protocol. Distributed Comput. Rob J. van Glabbeek, Peter Höfner, Marius Portmann, Wee Lum Tan
2015	J	`jnl`	A Process Algebra for Wireless Mesh Networks. CoRR Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan
2015	J	`jnl`	A Rigorous Analysis of AODV and its Variants. CoRR Peter Höfner, Rob J. van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver, Ansgar Fehnker
2015	J	`jnl`	A mechanized proof of loop freedom of the (untimed) AODV routing protocol. CoRR Timothy Bourke, Rob J. van Glabbeek, Peter Höfner
2015	J	`jnl`	Analysing and Comparing Encodability Criteria for Process Calculi. Arch. Formal Proofs Kirstin Peters, Rob J. van Glabbeek
2015	—	`conf`	Analysing and Comparing Encodability Criteria. EXPRESS/SOS Kirstin Peters, Rob J. van Glabbeek
2015	J	`jnl`	Automated Analysis of AODV using UPPAAL. CoRR Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan
2015	J	`jnl`	CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions. CoRR Rob J. van Glabbeek, Peter Höfner
2015	J	`jnl`	CCS: It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions. Acta Informatica Rob J. van Glabbeek, Peter Höfner
2015	J	`jnl`	Mechanizing a Process Algebra for Network Protocols. CoRR Timothy Bourke, Rob J. van Glabbeek, Peter Höfner
2015	J	`jnl`	Modelling and Analysis of AODV in UPPAAL. CoRR Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan
2015	J	`jnl`	Modelling and Verifying the AODV Routing Protocol. CoRR Rob J. van Glabbeek, Peter Höfner, Marius Portmann, Wee Lum Tan
2015	J	`jnl`	On the Axiomatizability of Impossible Futures. Log. Methods Comput. Sci. Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek
2015	—	`ed.`	Proceedings Workshop on Models for Formal Analysis of Real Systems, MARS 2015, Suva, Fiji, November 23, 2015. MARS Rob J. van Glabbeek, Jan Friso Groote, Peter Höfner
2015	J	`jnl`	Progress, Fairness and Justness in Process Algebra. CoRR Rob J. van Glabbeek, Peter Höfner
2015	J	`jnl`	Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops. CoRR Rob J. van Glabbeek, Peter Höfner, Wee Lum Tan, Marius Portmann
2015	J	`jnl`	Special issue on "Combining Compositionality and Concurrency": part 1. Acta Informatica Rob J. van Glabbeek, Ursula Goltz, Ernst-Rüdiger Olderog
2015	J	`jnl`	Special issue on "Combining Compositionality and Concurrency": part 2. Acta Informatica Rob J. van Glabbeek, Ursula Goltz, Ernst-Rüdiger Olderog
2015	—	`conf`	Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP. Correct System Design Rob J. van Glabbeek
2015	J	`jnl`	Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP. CoRR Rob J. van Glabbeek
2014	B	`conf`	A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol. ATVA Timothy Bourke, Rob J. van Glabbeek, Peter Höfner
2014	J	`jnl`	Real-reward testing for probabilistic processes. Theor. Comput. Sci. Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
2014	B	`conf`	Showing Invariance Compositionally for a Process Algebra for Network Protocols. ITP Timothy Bourke, Rob J. van Glabbeek, Peter Höfner
2014	J	`jnl`	Showing invariance compositionally for a process algebra for network protocols. CoRR Timothy Bourke, Rob J. van Glabbeek, Peter Höfner
2013	J	`jnl`	A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV. CoRR Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan
2013	J	`jnl`	On Characterising Distributability. Log. Methods Comput. Sci. Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann
2013	A	`conf`	Sequence numbers do not guarantee loop freedom: AODV can yield routing loops. MSWiM Rob J. van Glabbeek, Peter Höfner, Wee Lum Tan, Marius Portmann
2012	A	`conf`	A Process Algebra for Wireless Mesh Networks. ESOP Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan
2012	A	`conf`	A rigorous analysis of AODV and its variants. MSWiM Peter Höfner, Rob J. van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver, Ansgar Fehnker
2012	A	`conf`	Automated Analysis of AODV Using UPPAAL. TACAS Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan
2012	J	`jnl`	Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity. Inf. Comput. Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind
2012	—	`conf`	Musings on Encodings and Expressiveness EXPRESS/SOS Rob J. van Glabbeek
2012	J	`jnl`	On Distributability of Petri Nets CoRR Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann
2012	B	`conf`	On Distributability of Petri Nets - (Extended Abstract). FoSSaCS Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann
2011	J	`jnl`	Abstract Processes of Place/Transition Systems CoRR Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
2011	J	`jnl`	Abstract processes of place/transition systems. Inf. Process. Lett. Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
2011	—	`ch.`	Bisimulation. Encyclopedia of Parallel Computing Rob J. van Glabbeek
2011	B	`conf`	On Causal Semantics of Petri Nets. CONCUR Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
2011	J	`jnl`	On cool congruence formats for weak bisimulations. Theor. Comput. Sci. Rob J. van Glabbeek
2011	—	`conf`	Real-Reward Testing for Probabilistic Processes (Extended Abstract) QAPL Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
2010	J	`jnl`	Characterising Probabilistic Processes Logically CoRR Yuxin Deng, Rob J. van Glabbeek
2010	—	`conf`	Characterising Probabilistic Processes Logically - (Extended Abstract). LPAR (Yogyakarta) Yuxin Deng, Rob J. van Glabbeek
2010	J	`jnl`	On CSP and the Algebraic Theory of Effects CoRR Rob J. van Glabbeek, Gordon D. Plotkin
2010	—	`ch.`	On CSP and the Algebraic Theory of Effects. Reflections on the Work of C. A. R. Hoare Rob J. van Glabbeek, Gordon D. Plotkin
2010	J	`jnl`	The Coarsest Precongruences Respecting Safety and Liveness Properties CoRR Rob J. van Glabbeek
2010	—	`conf`	The Coarsest Precongruences Respecting Safety and Liveness Properties. IFIP TCS Rob J. van Glabbeek
2009	J	`jnl`	Branching Bisimilarity with Explicit Divergence. Fundam. Informaticae Rob J. van Glabbeek, Bas Luttik, Nikola Trcka
2009	J	`jnl`	Computation Tree Logic with Deadlock Detection Log. Methods Comput. Sci. Rob J. van Glabbeek, Bas Luttik, Nikola Trcka
2009	J	`jnl`	Configuration Structures, Event Structures and Petri Nets CoRR Rob J. van Glabbeek, Gordon D. Plotkin
2009	J	`jnl`	Configuration structures, event structures and Petri nets. Theor. Comput. Sci. Rob J. van Glabbeek, Gordon D. Plotkin
2009	B	`conf`	On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. SOFSEM Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek
2009	J	`jnl`	On Synchronous and Asynchronous Interaction in Distributed Systems CoRR Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
2009	J	`jnl`	Special issue on structural operational semantics. Inf. Comput. Rob J. van Glabbeek, Peter D. Mosses
2009	J	`jnl`	Symmetric and Asymmetric Asynchronous Interaction CoRR Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
2009	B	`conf`	Testing Finitary Probabilistic Processes. CONCUR Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
2008	J	`jnl`	Branching Bisimilarity with Explicit Divergence CoRR Rob J. van Glabbeek, Bas Luttik, Nikola Trcka
2008	J	`jnl`	Characterising Testing Preorders for Finite Probabilistic Processes CoRR Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan
2008	J	`jnl`	Characterising Testing Preorders for Finite Probabilistic Processes. Log. Methods Comput. Sci. Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
2008	A*	`conf`	Correcting a Space-Efficient Simulation Algorithm. CAV Rob J. van Glabbeek, Bas Ploeger
2008	C	`conf`	Five Determinisation Algorithms. CIAA Rob J. van Glabbeek, Bas Ploeger
2008	J	`jnl`	On Finite Bases for Weak Semantics: Failures versus Impossible Futures CoRR Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek
2008	B	`conf`	On Synchronous and Asynchronous Interaction in Distributed Systems. MFCS Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
2008	J	`jnl`	Ready to preorder: The case of weak process semantics. Inf. Process. Lett. Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek
2008	—	`conf`	Symmetric and Asymmetric Asynchronous Interaction. ICE@ICALP Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
2007	A*	`conf`	Characterising Testing Preorders for Finite Probabilistic Processes. LICS Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
2007	—	`conf`	Preface. SOS@LICS/ICALP Rob J. van Glabbeek, Matthew Hennessy
2007	—	`conf`	Remarks on Testing Probabilistic Processes. Computation, Meaning, and Logic Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
2007	A	`conf`	Scalar Outcomes Suffice for Finitary Probabilistic Testing. ESOP Yuxin Deng, Rob J. van Glabbeek, Carroll Morgan, Chenyi Zhang
2006	J	`jnl`	Compositionality of Hennessy-Milner logic by structural operational semantics. Theor. Comput. Sci. Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind
2006	J	`jnl`	Erratum to "On the expressiveness of higher dimensional automata": [TCS 356 (2006) 265-290]. Theor. Comput. Sci. Rob J. van Glabbeek
2006	B	`conf`	Liveness, Fairness and Impossible Futures. CONCUR Rob J. van Glabbeek, Marc Voorhoeve
2006	J	`jnl`	On the expressiveness of higher dimensional automata. Theor. Comput. Sci. Rob J. van Glabbeek
2006	—	`conf`	Preface. SOS@CONCUR Rob J. van Glabbeek, Peter D. Mosses
2005	—	`conf`	A Characterisation of Weak Bisimulation Congruence. Processes, Terms and Cycles Rob J. van Glabbeek
2005	—	`conf`	Divide and Congruence Applied to SOS@ICALP Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind
2005	—	`conf`	Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. FMCO Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind
2005	C	`conf`	On Cool Congruence Formats for Weak Bisimulations. ICTAC Rob J. van Glabbeek
2005	—	`conf`	On Specifying Timeouts. APC 25 Rob J. van Glabbeek
2005	J	`jnl`	Proof nets for unit-free multiplicative-additive linear logic. ACM Trans. Comput. Log. Dominic J. D. Hughes, Rob J. van Glabbeek
2005	B	`conf`	The Individual and Collective Token Interpretations of Petri Nets. CONCUR Rob J. van Glabbeek
2004	B	`conf`	Event Structures for Resolvable Conflict. MFCS Rob J. van Glabbeek, Gordon D. Plotkin
2004	J	`jnl`	Nested semantics over finite trees are equationally hard. Inf. Comput. Luca Aceto, Wan J. Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir
2004	—	`conf`	On the Expressiveness of Higher Dimensional Automata: (Extended Abstract). EXPRESS Rob J. van Glabbeek
2004	J	`jnl`	Precongruence formats for decorated trace semantics. ACM Trans. Comput. Log. Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek
2004	J	`jnl`	The meaning of negative premises in transition system specifications II. J. Log. Algebraic Methods Program. Rob J. van Glabbeek
2004	J	`jnl`	Well-behaved flow event structures for parallel composition and action refinement. Theor. Comput. Sci. Rob J. van Glabbeek, Ursula Goltz
2003	B	`conf`	Bundle Event Structures and CCSP. CONCUR Rob J. van Glabbeek, Frits W. Vaandrager
2003	B	`conf`	Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. FCT Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind
2003	A*	`conf`	Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract). LICS Dominic J. D. Hughes, Rob J. van Glabbeek
2003	A	`conf`	Query Nets: Interacting Workflow Modules That Ensure Global Termination. Business Process Management Rob J. van Glabbeek, David G. Stork
2002	J	`jnl`	Precongruence Formats for Decorated Trace Semantics CoRR Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek
2002	—	`conf`	Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow. ICATPN David G. Stork, Rob J. van Glabbeek
2001	J	`jnl`	Refinement of actions and equivalence notions for concurrent systems. Acta Informatica Rob J. van Glabbeek, Ursula Goltz
2001	—	`ch.`	The Linear Time - Branching Time Spectrum I. Handbook of Process Algebra Rob J. van Glabbeek
2001	—	`ch.`	What is Branching Time Semantics and Why to Use it? Current Trends in Theoretical Computer Science Rob J. van Glabbeek
2000	A*	`conf`	Precongruence Formats for Decorated Trace Preorders. LICS Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek
2000	J	`jnl`	Preface. Inf. Comput. Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek
1999	B	`conf`	Petri Nets, Configuration Structures and Higher Dimensional Automata. CONCUR Rob J. van Glabbeek
1998	J	`jnl`	Axiomatizing Flat Iteration CoRR Rob J. van Glabbeek
1998	—	`conf`	Scheduling Algebra. AMAST Rob J. van Glabbeek, Peter Rittgen
1997	B	`conf`	Axiomatizing Flat Iteration. CONCUR Rob J. van Glabbeek
1997	J	`jnl`	Notes on the Methodology of CCS and CSP. Theor. Comput. Sci. Rob J. van Glabbeek
1997	J	`jnl`	The Difference between Splitting in n and n+1. Inf. Comput. Rob J. van Glabbeek, Frits W. Vaandrager
1996	J	`jnl`	Axiomatizing Prefix Iteration with Silent Steps. Inf. Comput. Luca Aceto, Rob J. van Glabbeek, Wan J. Fokkink, Anna Ingólfsdóttir
1996	J	`jnl`	Branching Time and Abstraction in Bisimulation Semantics. J. ACM Rob J. van Glabbeek, W. P. Weijland
1996	J	`jnl`	Ntyft/Ntyxt Rules Reduce to Ntree Rules. Inf. Comput. Wan J. Fokkink, Rob J. van Glabbeek
1996	A*	`conf`	The Meaning of Negative Premises in Transition System Specifications II. ICALP Rob J. van Glabbeek
1995	A*	`conf`	Configuration Structures LICS Rob J. van Glabbeek, Gordon D. Plotkin
1995	J	`jnl`	Reactive, Generative and Stratified Models of Probabilistic Processes Inf. Comput. Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen
1994	—	`conf`	Axiomatising ST-Bisimulation Equivalence. PROCOMET Nadia Busi, Rob J. van Glabbeek, Roberto Gorrieri
1994	J	`jnl`	What is Branching time semantics and why to use it? Bull. EATCS Rob J. van Glabbeek
1993	B	`conf`	A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours. MFCS Rob J. van Glabbeek
1993	—	`conf`	Full Abstraction in Structural Operational Semantics (Extended Abstract). AMAST Rob J. van Glabbeek
1993	J	`jnl`	Modular Specification of Process Algebras. Theor. Comput. Sci. Rob J. van Glabbeek, Frits W. Vaandrager
1993	B	`conf`	The Linear Time - Branching Time Spectrum II. CONCUR Rob J. van Glabbeek
1992	—	`ch.`	Interleaving semantics and action refinement with atomic choice. Advances in Petri Nets: The DEMON Project Ingo Czaja, Rob J. van Glabbeek, Ursula Goltz
1990	—	`conf`	Equivalences and Refinement. Semantics of Systems of Concurrent Processes Rob J. van Glabbeek, Ursula Goltz
1990	A*	`conf`	Reactive, Generative, and Stratified Models of Probabilistic Processes LICS Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen, Chris M. N. Tofts
1990	B	`conf`	The Linear Time-Branching Time Spectrum (Extended Abstract). CONCUR Rob J. van Glabbeek
1990	—	`conf`	The Refinement Theorem for ST-bisimulation Semantics. Programming Concepts and Methods Rob J. van Glabbeek
1989	—	`conf`	Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract). IFIP Congress Rob J. van Glabbeek, W. P. Weijland
1989	B	`conf`	Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract). MFCS Rob J. van Glabbeek, Ursula Goltz
1989	J	`jnl`	Parial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care. Bull. EATCS Rob J. van Glabbeek, Ursula Goltz
1989	—	`conf`	Refinement of Actions in Causality Based Models. REX Workshop Rob J. van Glabbeek, Ursula Goltz
1987	A*	`conf`	Another Look at Abstraction in Process Algebra (Extended Abstract). ICALP Jos C. M. Baeten, Rob J. van Glabbeek
1987	A	`conf`	Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. STACS Rob J. van Glabbeek
1987	—	`conf`	Merge and Termination in Process Algebra. FSTTCS Jos C. M. Baeten, Rob J. van Glabbeek
1987	—	`conf`	Modular Specifications in Process Algebra with Curious Queues. Algebraic Methods Rob J. van Glabbeek, Frits W. Vaandrager
1987	—	`conf`	Petri Net Models for Algebraic Theories of Concurrency. PARLE (2) Rob J. van Glabbeek, Frits W. Vaandrager