( en | de | ru )

 

Disambiguation of "van Glabbeek, Rob J."

Author of the publication

copydeleteadd this publication to your clipboard
CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions.

, and . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rob J F Cornelissen

Klaus Rob

J Leo van Hemmen

Peter J van Zijl

Paul Rob

 

Other publications of authors with the same name

MALL proof nets identify proofs modulo rule commutation., and . CoRR, (2016)The Coarsest Precongruences Respecting Safety and Liveness Properties. CoRR, (2010)Petri Net Models for Algebraic Theories of Concurrency., and . PARLE (2), volume 259 of Lecture Notes in Computer Science, page 224-242. Springer, (1987)The Linear Time-Branching Time Spectrum (Extended Abstract).. CONCUR, volume 458 of Lecture Notes in Computer Science, page 278-297. Springer, (1990)On cool congruence formats for weak bisimulations.. Theor. Comput. Sci., 412 (28): 3283-3302 (2011)Erratum to Ön the expressiveness of higher dimensional automata": TCS 356 (2006) 265-290.. Theor. Comput. Sci., 368 (1-2): 168-194 (2006)The Linear Time - Branching Time Spectrum I.. Handbook of Process Algebra, North-Holland / Elsevier, (2001)A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours.. MFCS, volume 711 of Lecture Notes in Computer Science, page 473-484. Springer, (1993)The Meaning of Negative Premises in Transition System Specifications II.. ICALP, volume 1099 of Lecture Notes in Computer Science, page 502-513. Springer, (1996)Modular Specifications in Process Algebra with Curious Queues., and . Algebraic Methods, volume 394 of Lecture Notes in Computer Science, page 465-506. Springer, (1987)