Rob J. van Glabbeek - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Rob J. van Glabbeek' as author, editor, or advisor:

A Branching Time Model of CSPRob J. van Glabbeek. BIRTHDAY 2017: 272-293 [doi]
Divide and Congruence II: Delay and Weak BisimilarityWan Fokkink, Rob J. van Glabbeek. lics 2016: 778-787 [doi]
π-calculusRob J. van Glabbeek. ipl, 137:17-25, 2018. [doi]
Lean and full congruence formats for recursionRob J. van Glabbeek. lics 2017: 1-11 [doi]
Configuration structures, event structures and Petri netsRob J. van Glabbeek, Gordon D. Plotkin. TCS, 410(41):4111-4159, 2009. [doi]
Branching Bisimilarity with Explicit DivergenceRob J. van Glabbeek, Bas Luttik, Nikola Trcka. FUIN, 93(4):371-392, 2009. [doi]
Symmetric and Asymmetric Asynchronous InteractionRob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke. ENTCS, 229(3):77-95, 2009. [doi]
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing ProtocolTimothy Bourke, Rob J. van Glabbeek, Peter Höfner. ATVA 2014: 47-63 [doi]
Reactive, Generative and Stratified Models of Probabilistic ProcessesRob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen. iandc, 121(1):59-80, August 1995.
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarityWan Fokkink, Rob J. van Glabbeek, Paulien de Wind. iandc, 214:59-85, 2012. [doi]
Modular Specification of Process AlgebrasRob J. van Glabbeek, Frits W. Vaandrager. TCS, 113(2):293-348, 1993.
Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSPRob J. van Glabbeek. BIRTHDAY 2015: 99-130 [doi]
Analysing AWN-Specifications Using mCRL2 (Extended Abstract)Rob J. van Glabbeek, Peter Höfner, Djurre van der Wal. IFM 2018: 398-418 [doi]
The Linear Time - Branching Time Spectrum IRob J. van Glabbeek. In Jan A. Bergstra, Alban Ponse, Scott A. Smolka, editors, Handbook of Process Algebra. pages 3-99, North-Holland / Elsevier, 2001. [doi]
Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarityWan Fokkink, Rob J. van Glabbeek. iandc, 257:79-113, 2017. [doi]
PrefaceRob J. van Glabbeek, Peter D. Mosses. ENTCS, 175(1):1-2, 2007. [doi]
Divide and Congruence III: Stability & DivergenceWan J. Fokkink, Rob J. van Glabbeek, Bas Luttik. concur 2017: [doi]
On cool congruence formats for weak bisimulationsRob J. van Glabbeek. TCS, 412(28):3283-3302, 2011. [doi]
Erratum to On the expressiveness of higher dimensional automata : [TCS 356 (2006) 265-290]Rob J. van Glabbeek. TCS, 368(1-2):168-194, 2006. [doi]
Automated Analysis of AODV Using UPPAALAnsgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan. TACAS 2012: 173-187 [doi]
On Distributability of Petri Nets - (Extended Abstract)Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann. fossacs 2012: 331-345 [doi]
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)Rob J. van Glabbeek, Ursula Goltz. mfcs 1989: 237-248
Characterising Probabilistic Processes Logically - (Extended Abstract)Yuxin Deng, Rob J. van Glabbeek. lpar 2010: 278-293 [doi]
A Process Algebra for Wireless Mesh NetworksAnsgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan. ESOP 2012: 295-315 [doi]
Ntyft/Ntyxt Rules Reduce to Ntree RulesWan Fokkink, Rob J. van Glabbeek. iandc, 126(1):1-10, 1996.
Characterising Testing Preorders for Finite Probabilistic ProcessesYuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan. lmcs, 4(4), 2008. [doi]
Analysing and Comparing Encodability Criteria for Process CalculiKirstin Peters, Rob J. van Glabbeek. afp, 2015, 2015. [doi]
Special issue on "Combining Compositionality and Concurrency": part 2Rob J. van Glabbeek, Ursula Goltz, Ernst-Rüdiger Olderog. ACTA, 52(4-5):303-304, 2015. [doi]
Precongruence Formats with Lookahead through Modal DecompositionWan J. Fokkink, Rob J. van Glabbeek. csl 2017: [doi]
Mechanizing a Process Algebra for Network ProtocolsTimothy Bourke, Rob J. van Glabbeek, Peter Höfner. JAR, 56(3):309-341, 2016. [doi]
Modelling and verifying the AODV routing protocolRob J. van Glabbeek, Peter Höfner, Marius Portmann, Wee Lum Tan. dc, 29(4):279-315, 2016. [doi]
The Coarsest Precongruences Respecting Safety and Liveness PropertiesRob J. van Glabbeek. ifipTCS 2010: 32-52 [doi]
Testing Finitary Probabilistic ProcessesYuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan. concur 2009: 274-288 [doi]
Event Structures for Resolvable ConflictRob J. van Glabbeek, Gordon D. Plotkin. mfcs 2004: 550-561 [doi]
Special issue on "Combining Compositionality and Concurrency": part 1Rob J. van Glabbeek, Ursula Goltz, Ernst-Rüdiger Olderog. ACTA, 52(1):3-4, 2015. [doi]
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract)Rob J. van Glabbeek, Jan Friso Groote, Erik P. de Vink. BIRTHDAY 2019: 139-162 [doi]
Showing Invariance Compositionally for a Process Algebra for Network ProtocolsTimothy Bourke, Rob J. van Glabbeek, Peter Höfner. itp 2014: 144-159 [doi]
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching BisimulationWan Fokkink, Rob J. van Glabbeek, Paulien de Wind. FMCO 2006: 195-218 [doi]
A Characterisation of Weak Bisimulation CongruenceRob J. van Glabbeek. BIRTHDAY 2005: 26-39 [doi]
On CSP and the Algebraic Theory of EffectsRob J. van Glabbeek, Gordon D. Plotkin. In A. W. Roscoe, Clifford B. Jones, Kenneth R. Wood, editors, Reflections on the Work of C. A. R. Hoare. pages 333-369, Springer, 2010. [doi]
Sequence numbers do not guarantee loop freedom: AODV can yield routing loopsRob J. van Glabbeek, Peter Höfner, Wee Lum Tan, Marius Portmann. mswim 2013: 91-100 [doi]
Petri Nets, Configuration Structures and Higher Dimensional AutomataRob J. van Glabbeek. concur 1999: 21-27 [doi]
A rigorous analysis of AODV and its variantsPeter Höfner, Rob J. van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver, Ansgar Fehnker. mswim 2012: 203-212 [doi]
Real-reward testing for probabilistic processesYuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan. TCS, 538:16-36, 2014. [doi]
The Meaning of Negative Premises in Transition System Specifications IIRob J. van Glabbeek. icalp 1996: 502-513
On Causal Semantics of Petri NetsRob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke. concur 2011: 43-59 [doi]
Abstract processes of place/transition systemsRob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke. ipl, 111(13):626-633, 2011. [doi]
CCS: It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptionsRob J. van Glabbeek, Peter Höfner. ACTA, 52(2-3):175-205, 2015. [doi]
A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)Emile Bres, Rob J. van Glabbeek, Peter Höfner. ESOP 2016: 95-122 [doi]

runs on WebDSL