Rob van Glabbeek
Rob van Glabbeek
Data61, CSIRO and UNSW
Verifierad e-postadress på - Startsida
TitelCiteras avÅr
The linear time-branching time spectrum I. The semantics of concrete, sequential processes
RJ Van Glabbeek
Handbook of process algebra, 3-99, 2001
Branching time and abstraction in bisimulation semantics
RJ Van Glabbeek, WP Weijland
Journal of the ACM (JACM) 43 (3), 555-600, 1996
The linear time-branching time spectrum II: the semantics of sequential systems with silent moves.
RJ van Glabbeek
CONCUR'93, 66-81, 1993
Reactive, generative, and stratified models of probabilistic processes
RJ VanGlabbeek, SA Smolka, B Steffen
Information and Computation 121 (1), 59-80, 1995
Petri net models for algebraic theories of concurrency
R Van Glabbeek, F Vaandrager
International Conference on Parallel Architectures and Languages Europe, 224-242, 1987
Refinement of actions and equivalence notions for concurrent systems
R van Glabbeek, U Goltz
Acta Informatica 37 (4-5), 229-327, 2001
Equivalence notions for concurrent systems and refinement of actions
R van Glabbeek, U Goltz
International Symposium on Mathematical Foundations of Computer Science, 237-248, 1989
Comparative concurrency semantics and refinement of actions
RJ van Glabbeek
Centrum voor Wiskunde en Informatica, 1990
The linear time-branching time spectrum
RJ Glabbeek
CONCUR'90 Theories of Concurrency: Unification and Extension, 1990
Configuration structures
RJ van Glabbeek, GD Plotkin
Logic in Computer Science, 1995. LICS'95. Proceedings., Tenth Annual IEEE …, 1995
Bounded Nondeterminism and The Approximation Induction Principle in Process Algebra
RJ van Glabbeek
STACS 87, 336-347, 1987
Proof nets for unit-free multiplicative-additive linear logic
DJD Hughes, RJ van Glabbeek
ACM Transactions on Computational Logic (TOCL) 6 (4), 784-842, 2005
Refinement of actions in causality based models
R van Glabbeek, U Goltz
Workshop/School/Symposium of the REX Project (Research and Education in …, 1989
Document controlled workflow systems and methods
DG Stork, R Van Glabbeek
US Patent 7,120,699, 2006
Characterising testing preorders for finite probabilistic processes
Y Deng, R van Glabbeek, M Hennessy, C Morgan, C Zhang
Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE Symposium on …, 2007
On the expressiveness of higher dimensional automata
RJ van Glabbeek
Theoretical computer science 356 (3), 265-290, 2006
Ntyft/ntyxt rules reduce to ntree rules
W Fokkink, RJ van Glabbeek
Information and Computation 126 (1), 1-10, 1996
The refinement theorem for ST-bisimulation semantics
RJ van Glabbeek
Centre for Mathematics and Computer Science, 1990
Configuration structures, event structures and Petri nets
RJ van Glabbeek, GD Plotkin
Theoretical Computer Science 410 (41), 4111-4159, 2009
Precongruence formats for decorated trace semantics
B Bloom, W Fokkink, RJ Van Glabbeek
ACM Transactions on Computational Logic (TOCL) 5 (1), 26-78, 2004
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20