Person:287371: Difference between revisions

From MaRDI portal
Person:287371
m AuthorDisambiguator moved page Person:843104 to Robert J. van Glabbeek: Duplicate
m AuthorDisambiguator moved page Robert J. van Glabbeek to Robert J. van Glabbeek: Duplicate
 
(No difference)

Latest revision as of 14:42, 6 December 2023

Available identifiers

zbMath Open van-glabbeek.robert-janMaRDI QIDQ287371

List of research outcomes





PublicationDate of PublicationType
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice2024-03-14Paper
Stronger Validity Criteria for Encoding Synchrony2024-03-14Paper
Reward testing equivalences for processes2024-02-23Paper
Comparing the Expressiveness of the π-calculus and CCS2024-02-21Paper
Just testing2023-11-24Paper
A process algebra for link layer protocols2023-11-24Paper
Modelling mutual exclusion in a process algebra with time-outs2023-09-27Paper
CONCUR Test-Of-Time Award 2021 (Invited Paper)2023-08-21Paper
Enabling Preserving Bisimulation Equivalence2023-08-21Paper
Comparing the expressiveness of the \(\pi \)-calculus and CCS2023-08-03Paper
Fair must testing for I/O automata2023-07-26Paper
Analysing AWN-Specifications Using mCRL2 (Extended Abstract)2023-06-28Paper
Cross-chain payment protocols with success guarantees2023-06-19Paper
Axiomatizing flat iteration2023-05-17Paper
Reactive bisimulation semantics for a process algebra with timeouts2023-03-01Paper
Abstract processes in the absence of conflicts in general place/transition systems2022-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50892692022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50209452022-01-07Paper
https://portal.mardi4nfdi.de/entity/Q33856512021-12-20Paper
https://portal.mardi4nfdi.de/entity/Q50147972021-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50138712021-12-03Paper
Abstract processes and conflicts in place/transition systems2021-11-25Paper
https://portal.mardi4nfdi.de/entity/Q50094142021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q49894062021-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49862612021-04-27Paper
https://portal.mardi4nfdi.de/entity/Q49658112021-03-10Paper
https://portal.mardi4nfdi.de/entity/Q51446892021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q51193952020-09-04Paper
Divide and congruence III: Stability & divergence2020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51111932020-05-26Paper
Justness. A completeness criterion for capturing liveness properties (extended abstract)2020-01-28Paper
Ensuring liveness properties of distributed systems: open problems2019-11-28Paper
Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence2019-09-17Paper
Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours2018-12-19Paper
A theory of encodings and expressiveness (extended abstract)2018-07-17Paper
On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus2018-06-15Paper
Divide and Congruence II2018-04-23Paper
A branching time model of CSP2018-03-26Paper
Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity2017-11-16Paper
Precongruence formats for decorated trace semantics2017-07-12Paper
Proof nets for unit-free multiplicative-additive linear logic2017-07-12Paper
Modelling and verifying the AODV routing protocol2016-10-17Paper
Mechanizing a process algebra for network protocols2016-05-26Paper
A Timed Process Algebra for Wireless Networks with an Application in Routing2016-04-26Paper
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol2015-12-17Paper
Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP2015-11-04Paper
On the Axiomatizability of Impossible Futures2015-10-29Paper
On Specifying Timeouts2015-07-10Paper
CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions2015-04-16Paper
Showing Invariance Compositionally for a Process Algebra for Network Protocols2014-09-08Paper
Symmetric and Asymmetric Asynchronous Interaction2014-06-27Paper
Real-reward testing for probabilistic processes2014-06-06Paper
Remarks on Testing Probabilistic Processes2013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28520972013-10-07Paper
On Characterising Distributability2013-09-26Paper
https://portal.mardi4nfdi.de/entity/Q28481332013-09-25Paper
Abstract processes of place/transition systems2013-04-04Paper
Preface2013-03-22Paper
A Process Algebra for Wireless Mesh Networks2012-06-22Paper
On Distributability of Petri Nets2012-06-22Paper
Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity2012-05-24Paper
On Causal Semantics of Petri Nets2011-09-02Paper
On cool congruence formats for weak bisimulations2011-07-07Paper
The Coarsest Precongruences Respecting Safety and Liveness Properties2010-10-27Paper
On CSP and the Algebraic Theory of Effects2010-10-26Paper
Characterising Probabilistic Processes Logically2010-10-12Paper
Ready to preorder: the case of weak process semantics2010-06-09Paper
Fundamentals of Computation Theory2010-04-20Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
Computation Tree Logic with Deadlock Detection2010-01-28Paper
Testing Finitary Probabilistic Processes2009-10-22Paper
Configuration structures, event structures and Petri nets2009-09-29Paper
Branching Bisimilarity with Explicit Divergence2009-09-29Paper
Characterising Testing Preorders for Finite Probabilistic Processes2009-04-29Paper
Five Determinisation Algorithms2009-02-12Paper
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures2009-02-03Paper
On Synchronous and Asynchronous Interaction in Distributed Systems2009-02-03Paper
Correcting a Space-Efficient Simulation Algorithm2008-07-15Paper
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation2007-09-11Paper
Scalar Outcomes Suffice for Finitary Probabilistic Testing2007-09-04Paper
Liveness, Fairness and Impossible Futures2007-09-04Paper
Erratum to ``On the expressiveness of higher dimensional automata2007-01-22Paper
Processes, Terms and Cycles: Steps on the Road to Infinity2006-11-13Paper
Theoretical Aspects of Computing – ICTAC 20052006-11-01Paper
CONCUR 2005 – Concurrency Theory2006-11-01Paper
On the expressiveness of higher dimensional automata2006-05-29Paper
Compositionality of Hennessy-Milner logic by structural operational semantics2006-04-28Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Well-behaved flow event structures for parallel composition and action refinement2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48188612004-09-24Paper
The meaning of negative premises in transition system specifications. II2004-09-08Paper
https://portal.mardi4nfdi.de/entity/Q30452732004-08-12Paper
Nested semantics over finite trees are equationally hard2004-08-06Paper
Refinement of actions and equivalence notions for concurrent systems2001-02-20Paper
https://portal.mardi4nfdi.de/entity/Q27602382001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47904082001-01-01Paper
Notes on the methodology of CCS and CSP1998-07-23Paper
Branching time and abstraction in bisimulation semantics1998-01-21Paper
The difference between splitting in \(n\) and \(n+1\)1997-10-26Paper
Axiomatizing prefix iteration with silent steps1996-11-25Paper
\(Ntyft/ntyxt\) rules reduce to \(n\)tree rules1996-07-03Paper
https://portal.mardi4nfdi.de/entity/Q48743911996-04-23Paper
Reactive, generative, and stratified models of probabilistic processes1995-09-20Paper
https://portal.mardi4nfdi.de/entity/Q42998621995-04-04Paper
Modular specification of process algebras1993-08-08Paper
https://portal.mardi4nfdi.de/entity/Q39751461992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47320971989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37534751987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37616801987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37716321987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37766061987-01-01Paper

Research outcomes over time

This page was built for person: Robert J. van Glabbeek