356 results on '"van Glabbeek, Rob"'
Search Results
2. More on Maximally Permissive Similarity Control of Discrete Event Systems
- Author
-
Wang, Yu, Zhu, Zhaohui, van Glabbeek, Rob, Zhang, Jinjin, and Tan, Lixing
- Subjects
Computer Science - Formal Languages and Automata Theory - Abstract
Takai proposed a method for constructing a maximally permissive supervisor for the similarity control problem (IEEE Transactions on Automatic Control, 66(7):3197-3204, 2021). This paper points out flaws in his results by providing a counterexample. Inspired by Takai's construction, the notion of a (saturated) (G, R)-automaton is introduced and metatheorems concerning (maximally permissive) supervisors for the similarity control problem are provided in terms of this notion. As an application of these metatheorems, the flaws in Takai's work are corrected., Comment: 8 pages
- Published
- 2024
3. A Cancellation Law for Probabilistic Processes
- Author
-
van Glabbeek, Rob, Groote, Jan Friso, and de Vink, Erik
- Subjects
Computer Science - Logic in Computer Science ,F.3.1 - Abstract
We show a cancellation property for probabilistic choice. If distributions mu + rho and nu + rho are branching probabilistic bisimilar, then distributions mu and nu are also branching probabilistic bisimilar. We do this in the setting of a basic process language involving non-deterministic and probabilistic choice and define branching probabilistic bisimilarity on distributions. Despite the fact that the cancellation property is very elegant and concise, we failed to provide a short and natural combinatorial proof. Instead we provide a proof using metric topology. Our major lemma is that every distribution can be unfolded into an equivalent stable distribution, where the topological arguments are required to deal with uncountable branching., Comment: In Proceedings EXPRESS/SOS2023, arXiv:2309.05788
- Published
- 2023
- Full Text
- View/download PDF
4. A Lean-Congruence Format for EP-Bisimilarity
- Author
-
van Glabbeek, Rob, Höfner, Peter, and Wang, Weiyou
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 ,F.1.2 - Abstract
Enabling preserving bisimilarity is a refinement of strong bisimilarity that preserves safety as well as liveness properties. To define it properly, labelled transition systems needed to be upgraded with a successor relation, capturing concurrency between transitions enabled in the same state. We enrich the well-known De Simone format to handle inductive definitions of this successor relation. We then establish that ep-bisimilarity is a congruence for the operators, as well as lean congruence for recursion, for all (enriched) De Simone languages., Comment: In Proceedings EXPRESS/SOS2023, arXiv:2309.05788. A full version of this paper, enriched with two appendices, is available at arXiv:2308.16350
- Published
- 2023
- Full Text
- View/download PDF
5. Fair Must Testing for I/O Automata
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.1 ,F.1.2 ,F.3.2 - Abstract
The concept of must testing is naturally parametrised with a chosen completeness criterion or fairness assumption. When taking weak fairness as used in I/O automata, I show that it characterises exactly the fair preorder on I/O automata as defined by Lynch & Tuttle., Comment: Dedicated to Frits Vaandrager, at the occasion of his 60th birthday
- Published
- 2022
- Full Text
- View/download PDF
6. Just Testing
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 ,F.1.1 ,F.3.2 - Abstract
The concept of must testing is naturally parametrised with a chosen completeness criterion, defining the complete runs of a system. Here I employ justness as this completeness criterion, instead of the traditional choice of progress. The resulting must-testing preorder is incomparable with the default one, and can be characterised as the fair failure preorder of Vogler. It also is the coarsest precongruence preserving linear time properties when assuming justness. As my system model I here employ Petri nets with read arcs. Through their Petri net semantics, this work applies equally well to process algebras. I provide a Petri net semantics for a standard process algebra extended with signals; the read arcs are necessary to capture those signals.
- Published
- 2022
7. Abstract Processes in the Absence of Conflicts in General Place/Transition Systems
- Author
-
van Glabbeek, Rob, Goltz, Ursula, and Schicke-Uffmann, Jens-Wolfhard
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 - Abstract
Goltz and Reisig generalised Petri's concept of processes of one-safe Petri nets to general nets where places carry multiple tokens. BD-processes are equivalence classes of Goltz-Reisig processes connected through the swapping transformation of Best and Devillers; they can be considered as an alternative representation of runs of nets. Here we present an order respecting bijection between the BD-processes and the FS-processes of a countable net, the latter being defined -- in an analogous way -- as equivalence classes of firing sequences. Using this, we show that a countable net without binary conflicts has a (unique) largest BD-process., Comment: The above result appeared already in our technical report arXiv:2103.00729, although formulated and proven differently, since there we didn't have the preorder $\sqsubseteq_1^\infty$, introduced in arXiv:2103.01490. Our revised proofs are conceptually simpler, as they avoid the auxiliary concepts of BD-runs and FS-runs
- Published
- 2022
- Full Text
- View/download PDF
8. Comparing the expressiveness of the $\pi$-calculus and CCS
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 - Abstract
This paper shows that the $\pi$-calculus with implicit matching is no more expressive than CCS$\gamma$, a variant of CCS in which the result of a synchronisation of two actions is itself an action subject to relabelling or restriction, rather than the silent action $\tau$. This is done by exhibiting a compositional translation from the $\pi$-calculus with implicit matching to CCS$\gamma$ that is valid up to strong barbed bisimilarity. The full $\pi$-calculus can be similarly expressed in CCS$\gamma$ enriched with the triggering operation of Meije. I also show that these results cannot be recreated with CCS in the role of CCS$\gamma$, not even up to reduction equivalence, and not even for the asynchronous $\pi$-calculus without restriction or replication. Finally I observe that CCS cannot be encoded in the $\pi$-calculus., Comment: Extended abstract to appear in Proc. ESOP'22
- Published
- 2022
9. Enabling Preserving Bisimulation Equivalence
- Author
-
van Glabbeek, Rob, Höfner, Peter, and Wang, Weiyou
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 ,F.1.1 ,F.3.2 - Abstract
Most fairness assumptions used for verifying liveness properties are criticised for being too strong or unrealistic. On the other hand, justness, arguably the minimal fairness assumption required for the verification of liveness properties, is not preserved by classical semantic equivalences, such as strong bisimilarity. To overcome this deficiency, we introduce a finer alternative to strong bisimilarity, called enabling preserving bisimilarity. We prove that this equivalence is justness-preserving and a congruence for all standard operators, including parallel composition., Comment: A version of this paper without Appendix B appears in Proc. CONCUR'21
- Published
- 2021
10. Modelling Mutual Exclusion in a Process Algebra with Time-outs
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 ,F.4.1 ,F.3.2 ,F.3.1 ,C.2.2 - Abstract
I show that in a standard process algebra extended with time-outs one can correctly model mutual exclusion in such a way that starvation-freedom holds without assuming fairness or justness, even when one makes the problem more challenging by assuming memory accesses to be atomic. This can be achieved only when dropping the requirement of speed independence., Comment: Mild revision in response to I&C reviewing, with added conclusion. arXiv admin note: text overlap with arXiv:2008.13357
- Published
- 2021
- Full Text
- View/download PDF
11. Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom
- Author
-
van Glabbeek, Rob, Höfner, Peter, and Horne, Ross
- Subjects
Computer Science - Logic in Computer Science ,F.3.1 ,F.4.1 ,F.1.2 ,F.3.3 - Abstract
We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix a minimal session calculus and systematically take into account all known fairness assumptions, thereby identifying precisely three interesting and semantically distinct notions of lock-freedom, all of which having a sound session type system. We then show that, by using a general merge operator in an otherwise standard approach to global session types, we obtain a session type system complete for the strongest amongst those notions of lock-freedom, which assumes only justness of execution paths, a minimal fairness assumption for concurrent systems., Comment: To appear in the Proceedings of LICS 2021
- Published
- 2021
12. Coinductive Validity
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science - Abstract
This note formally defines the concept of coinductive validity of judgements, and contrasts it with inductive validity. For both notions it shows how a judgement is valid iff it has a formal proof. Finally, it defines and illustrates the notion of a proof by coinduction.
- Published
- 2021
13. Just Testing
- Author
-
van Glabbeek, Rob, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Kupferman, Orna, editor, and Sobocinski, Pawel, editor
- Published
- 2023
- Full Text
- View/download PDF
14. Cross-chain payment protocols with success guarantees
- Author
-
van Glabbeek, Rob, Gramoli, Vincent, and Tholoniat, Pierre
- Published
- 2023
- Full Text
- View/download PDF
15. Abstract Processes and Conflicts in Place/Transition Systems
- Author
-
van Glabbeek, Rob, Goltz, Ursula, and Schicke-Uffmann, Jens-Wolfhard
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 - Abstract
For one-safe Petri nets or condition/event-systems, a process as defined by Carl Adam Petri provides a notion of a run of a system where causal dependencies are reflected in terms of a partial order. Goltz and Reisig have generalised this concept for nets where places carry multiple tokens, by distinguishing tokens according to their causal history. However, this so-called individual token interpretation is often considered too detailed. Here we identify a subclass of Petri nets, called structural conflict nets, where no interplay between conflict and concurrency due to token multiplicity occurs. For this subclass, we define abstract processes as equivalence classes of Goltz-Reisig processes. We justify this approach by showing that there is a largest abstract process if and only if the underlying net is conflict-free with respect to a canonical notion of conflict., Comment: The results of this paper appeared before in arXiv:2103.00729. However, there they were formulated differently, as we didn't have the current concept of a largest abstract process. Our proofs are conceptually much simpler than the ones in arXiv:2103.00729, as they are carried out directly on abstract processes, rather than via the auxiliary concepts of BD-runs and FS-runs. arXiv admin note: text overlap with arXiv:1103.5916
- Published
- 2021
- Full Text
- View/download PDF
16. On Causal Semantics of Petri Nets
- Author
-
van Glabbeek, Rob, Goltz, Ursula, and Schicke, Jens-Wolfhard
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 - Abstract
We consider approaches for causal semantics of Petri nets, explicitly representing dependencies between transition occurrences. For one-safe nets or condition/event-systems, the notion of process as defined by Carl Adam Petri provides a notion of a run of a system where causal dependencies are reflected in terms of a partial order. A well-known problem is how to generalise this notion for nets where places may carry several tokens. Goltz and Reisig have defined such a generalisation by distinguishing tokens according to their causal history. However, this so-called individual token interpretation is often considered too detailed. A number of approaches have tackled the problem of defining a more abstract notion of process, thereby obtaining a so-called collective token interpretation. Here we give a short overview on these attempts and then identify a subclass of Petri nets, called structural conflict nets, where the interplay between conflict and concurrency due to token multiplicity does not occur. For this subclass, we define abstract processes as equivalence classes of Goltz-Reisig processes. We justify this approach by showing that we obtain exactly one maximal abstract process if and only if the underlying net is conflict-free with respect to a canonical notion of conflict., Comment: This paper continues and completes the work of arXiv:1103.5916. Together, these papers show that a structural conflict net is conflict-free iff it has exactly one maximal run---equivalently formalised as maximal BD-run, maximal BD-process or maximal GR-process up to swapping equivalence. The "only if" direction, together with a taxonomy of suitable notions of maximality, is contributed here
- Published
- 2021
17. Reactive bisimulation semantics for a process algebra with timeouts
- Author
-
van Glabbeek, Rob
- Published
- 2023
- Full Text
- View/download PDF
18. Reactive Temporal Logic
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.4.1 ,F.3.2 ,F.3.1 ,F.1.2 - Abstract
Whereas standard treatments of temporal logic are adequate for closed systems, having no run-time interactions with their environment, they fall short for reactive systems, interacting with their environments through synchronisation of actions. This paper introduces reactive temporal logic, a form of temporal logic adapted for the study of reactive systems. I illustrate its use by applying it to formulate definitions of a fair scheduler, and of a correct mutual exclusion protocol. Previous definitions of these concepts were conceptually much more involved or less precise, leading to debates on whether or not a given protocol satisfies the implicit requirements., Comment: In Proceedings EXPRESS/SOS 2020, arXiv:2008.12414
- Published
- 2020
- Full Text
- View/download PDF
19. Reactive Bisimulation Semantics for a Process Algebra with Time-Outs
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 - Abstract
This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation., Comment: An extended abstract of this paper appears in the proceedings of CONCUR 2020
- Published
- 2020
- Full Text
- View/download PDF
20. Feasibility of Cross-Chain Payment with Success Guarantees
- Author
-
van Glabbeek, Rob, Gramoli, Vincent, and Tholoniat, Pierre
- Subjects
Computer Science - Distributed, Parallel, and Cluster Computing ,Computer Science - Logic in Computer Science ,C.2.4 ,D.2.4 ,F.1.1 ,F.1.2 - Abstract
We consider the problem of cross-chain payment whereby customers of different escrows---implemented by a bank or a blockchain smart contract---successfully transfer digital assets without trusting each other. Prior to this work, cross-chain payment problems did not require this success, or any form of progress. We demonstrate that it is possible to solve this problem when assuming synchrony, in the sense that each message is guaranteed to arrive within a known amount of time, but impossible to solve without assuming synchrony. Yet, we solve a weaker variant of this problem, where success is conditional on the patience of the participants, without assuming synchrony, and in the presence of Byzantine failures. We also discuss the relation with the recently defined cross-chain deals., Comment: This is a summary of the work reported in arXiv:1912.04513
- Published
- 2020
- Full Text
- View/download PDF
21. Formalising the Optimised Link State Routing Protocol
- Author
-
Barry, Ryan, van Glabbeek, Rob, and Höfner, Peter
- Subjects
Computer Science - Networking and Internet Architecture ,Computer Science - Logic in Computer Science - Abstract
Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise and verifiable descriptions of protocols. In this paper we use the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2., Comment: In Proceedings MARS 2020, arXiv:2004.12403
- Published
- 2020
- Full Text
- View/download PDF
22. Failure Trace Semantics for a Process Algebra with Time-outs
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 ,F.3.2 - Abstract
This paper extends a standard process algebra with a time-out operator, thereby increasing its absolute expressiveness, while remaining within the realm of untimed process algebra, in the sense that the progress of time is not quantified. Trace and failures equivalence fail to be congruences for this operator; their congruence closure is characterised as failure trace equivalence.
- Published
- 2020
- Full Text
- View/download PDF
23. Cross-Chain Payment Protocols with Success Guarantees
- Author
-
van Glabbeek, Rob, Gramoli, Vincent, and Tholoniat, Pierre
- Subjects
Computer Science - Distributed, Parallel, and Cluster Computing ,Computer Science - Logic in Computer Science - Abstract
In this paper, we consider the problem of cross-chain payment whereby customers of different escrows -- implemented by a bank or a blockchain smart contract -- successfully transfer digital assets without trusting each other. Prior to this work, cross-chain payment problems did not require this success or any form of progress. We introduce a new specification formalism called Asynchronous Networks of Timed Automata (ANTA) to formalise such protocols. We present the first cross-chain payment protocol that ensures termination in a bounded amount of time and works correctly in the presence of clock skew. We then demonstrate that it is impossible to solve this problem without assuming synchrony, in the sense that each message is guaranteed to arrive within a known amount of time. We also offer a protocol that solves an eventually terminating variant of this cross-chain payment problem without synchrony, and even in the presence of Byzantine failures.
- Published
- 2019
24. Modelling mutual exclusion in a process algebra with time-outs
- Author
-
van Glabbeek, Rob
- Published
- 2023
- Full Text
- View/download PDF
25. Justness: A Completeness Criterion for Capturing Liveness Properties
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 ,F.3.1 ,F.3.2 - Abstract
This paper poses that transition systems constitute a good model of distributed systems only in combination with a criterion telling which paths model complete runs of the represented systems. Among such criteria, progress is too weak to capture relevant liveness properties, and fairness is often too strong; for typical applications we advocate the intermediate criterion of justness. Previously, we proposed a definition of justness in terms of an asymmetric concurrency relation between transitions. Here we define such a concurrency relation for the transition systems associated to the process algebra CCS as well as its extensions with broadcast communication and signals, thereby making these process algebras suitable for capturing liveness properties requiring justness., Comment: This second version incorporates many small improvements based on feedback from Weiyou Wang. An extended abstract of this paper appears in Proc. FoSSaCS'19
- Published
- 2019
26. On the Meaning of Transition System Specifications
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 - Abstract
Transition System Specifications provide programming and specification languages with a semantics. They provide the meaning of a closed term as a process graph: a state in a labelled transition system. At the same time they provide the meaning of an n-ary operator, or more generally an open term with n free variables, as an n-ary operation on process graphs. The classical way of doing this, the closed-term semantics, reduces the meaning of an open term to the meaning of its closed instantiations. It makes the meaning of an operator dependent on the context in which it is employed. Here I propose an alternative process graph semantics of TSSs that does not suffer from this drawback. Semantic equivalences on process graphs can be lifted to open terms conform either the closed-term or the process graph semantics. For pure TSSs the latter is more discriminating. I consider five sanity requirements on the semantics of programming and specification languages equipped with a recursion construct: compositionality, applied to n-ary operators, recursion and variables, invariance under $\alpha$-conversion, and the recursive definition principle, saying that the meaning of a recursive call should be a solution of the corresponding recursion equations. I establish that the satisfaction of four of these requirements under the closed-term semantics of a TSS implies their satisfaction under the process graph semantics., Comment: In Proceedings EXPRESS/SOS 2019, arXiv:1908.08213
- Published
- 2019
- Full Text
- View/download PDF
27. Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence
- Author
-
Fokkink, Wan, van Glabbeek, Rob, and Luttik, Bas
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 ,F.1.2 - Abstract
In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must ensure that the formulas in the modal characterisation of this semantics are always decomposed into formulas that are again in this modal characterisation. The stability and divergence requirements that are imposed on many of the known weak semantics have so far been outside the realm of this method. Stability refers to the absence of a $\tau$-transition. We show, using the decomposition method, how congruence formats can be relaxed for weak semantics that are stability-respecting. This relaxation for instance brings the priority operator within the range of the stability-respecting branching bisimulation format. Divergence, which refers to the presence of an infinite sequence of $\tau$-transitions, escapes the inductive decomposition method. We circumvent this problem by proving that a congruence format for a stability-respecting weak semantics is also a congruence format for its divergence-preserving counterpart., Comment: An extended abstract of this paper appeared in Proc. CONCUR'17
- Published
- 2019
- Full Text
- View/download PDF
28. Ensuring Liveness Properties of Distributed Systems: Open Problems
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.3.1 - Abstract
Often fairness assumptions need to be made in order to establish liveness properties of distributed systems, but in many situations they lead to false conclusions. This document presents a research agenda aiming at laying the foundations of a theory of concurrency that is equipped to ensure liveness properties of distributed systems without making fairness assumptions. This theory will encompass process algebra, temporal logic and semantic models. The agenda also includes the development of a methodology and tools that allow successful application of this theory to the specification, analysis and verification of realistic distributed systems. Contemporary process algebras and temporal logics fail to make distinctions between systems of which one has a crucial liveness property and the other does not, at least when assuming justness, a strong progress property, but not assuming fairness. Setting up an alternative framework involves giving up on identifying strongly bisimilar systems, inventing new induction principles, developing new axiomatic bases for process algebras and new congruence formats for operational semantics, and creating matching treatments of time and probability. Even simple systems like fair schedulers or mutual exclusion protocols cannot be accurately specified in standard process algebras (or Petri nets) in the absence of fairness assumptions. Hence the work involves the study of adequate language or model extensions, and their expressive power., Comment: An earlier version of this paper appeared as arXiv:1711.04240
- Published
- 2019
- Full Text
- View/download PDF
29. Reward Testing Equivalences for Processes
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 - Abstract
May and must testing were introduced by De Nicola and Hennessy to define semantic equivalences on processes. May-testing equivalence exactly captures safety properties, and must-testing equivalence liveness properties. This paper proposes reward testing and shows that the resulting semantic equivalence also captures conditional liveness properties. It is strictly finer than both the may- and must-testing equivalence., Comment: This paper is dedicated to Rocco De Nicola, on the occasion of his 65th birthday. Rocco's work has been a source of inspiration to my own
- Published
- 2019
- Full Text
- View/download PDF
30. A Process Algebra for Link Layer Protocols
- Author
-
van Glabbeek, Rob, Höfner, Peter, and Markl, Michael
- Subjects
Computer Science - Networking and Internet Architecture ,Computer Science - Logic in Computer Science ,F.3.2 ,F.3.1 ,C.2.2 - Abstract
We propose a process algebra for link layer protocols, featuring a unique mechanism for modelling frame collisions. We also formalise suitable liveness properties for link layer protocols specified in this framework. To show applicability we model and analyse two versions of the Carrier-Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Our analysis confirms the hidden station problem for the version without virtual carrier sensing. However, we show that the version with virtual carrier sensing not only overcomes this problem, but also the exposed station problem with probability 1. Yet the protocol cannot guarantee packet delivery, not even with probability 1.
- Published
- 2019
- Full Text
- View/download PDF
31. Progress, Justness and Fairness
- Author
-
van Glabbeek, Rob and Höfner, Peter
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 ,F.3.1 ,F.3.2 - Abstract
Fairness assumptions are a valuable tool when reasoning about systems. In this paper, we classify several fairness properties found in the literature and argue that most of them are too restrictive for many applications. As an alternative we introduce the concept of justness.
- Published
- 2018
- Full Text
- View/download PDF
32. Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours
- Author
-
Fischer, Nick and van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 ,F.3.2 - Abstract
In concurrency theory, weak bisimilarity is often used to relate processes exhibiting the same observable behaviour. The probabilistic environment gives rise to several generalisations; we study the infinitary semantics, which abstracts from a potentially unbounded number of internal actions being performed when something observable happens. Arguing that this notion yields the most desirable properties, we provide a sound and complete axiomatisation capturing its essence. Previous research has failed to achieve completeness in the presence of unguarded recursion, as only the finitary variant has been axiomatised, yet.
- Published
- 2018
- Full Text
- View/download PDF
33. Comparing the expressiveness of the -calculus and CCS
- Author
-
van Glabbeek, Rob, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Sergey, Ilya, editor
- Published
- 2022
- Full Text
- View/download PDF
34. A Theory of Encodings and Expressiveness
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.1.2 - Abstract
This paper proposes a definition of what it means for one system description language to encode another one, thereby enabling an ordering of system description languages with respect to expressive power. I compare the proposed definition with other definitions of encoding and expressiveness found in the literature, and illustrate it on a well-known case study: the encoding of the synchronous in the asynchronous $\pi$-calculus., Comment: An extended abstract of this paper appeared in the proceedings of FoSSaCS 2018
- Published
- 2018
35. Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation
- Author
-
Gallagher, John P., van Glabbeek, Rob, and Serwe, Wendelin
- Subjects
Computer Science - Logic in Computer Science ,Computer Science - Formal Languages and Automata Theory ,Computer Science - Programming Languages - Abstract
This volume contains the joint proceedings of MARS 2018, the third workshop on Models for Formal Analysis of Real Systems, and VPT 2018, the sixth international workshop on Verification and Program Transformation, held together on April 20, 2018 in Thessaloniki, Greece, as part of ETAPS 2018, the European Joint Conferences on Theory and Practice of Software. MARS emphasises modelling over verification. It aims at discussing the lessons learned from making formal methods for the verification and analysis of realistic systems. Examples are: (1) Which formalism is chosen, and why? (2) Which abstractions have to be made and why? (3) How are important characteristics of the system modelled? (4) Were there any complications while modelling the system? (5) Which measures were taken to guarantee the accuracy of the model? We invited papers that present full models of real systems, which may lay the basis for future comparison and analysis. An aim of the workshop is to present different modelling approaches and discuss pros and cons for each of them. Alternative formal descriptions of the systems presented at this workshop are encouraged, which should foster the development of improved specification formalisms. VPT aims to provide a forum where people from the areas of program transformation and program verification can fruitfully exchange ideas and gain a deeper understanding of the interactions between those two fields. These interactions have been beneficial in both directions. On the one hand, methods and tools developed in the field of program transformation, such as partial deduction, partial evaluation, fold/unfold transformations, and supercompilation, are applied with success to verification, in particular to the verification of infinite state and parameterized systems. On the other hand, methods developed in program verification, such as model checking, abstract interpretation, SAT and SMT solving, and automated theorem proving, are used to enhance program transformation techniques, thereby making these techniques more powerful and useful in practice.
- Published
- 2018
- Full Text
- View/download PDF
36. On the Validity of Encodings of the Synchronous in the Asynchronous $\pi$-calculus
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 - Abstract
Process calculi may be compared in their expressive power by means of encodings between them. A widely accepted definition of what constitutes a valid encoding for (dis)proving relative expressiveness results between process calculi was proposed by Gorla. Prior to this work, diverse encodability and separation results were generally obtained using distinct, and often incompatible, quality criteria on encodings. Textbook examples of valid encoding are the encodings proposed by Boudol and by Honda & Tokoro of the synchronous choice-free $\pi$-calculus into its asynchronous fragment, illustrating that the latter is no less expressive than the former. Here I formally establish that these encodings indeed satisfy Gorla's criteria., Comment: Various minor improvements following IPL refereeing. Section 5 does not appear in IPL
- Published
- 2018
37. Rooted Divergence-Preserving Branching Bisimilarity is a Congruence
- Author
-
van Glabbeek, Rob, Luttik, Bas, and Spaninks, Linda
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 - Abstract
We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.
- Published
- 2018
- Full Text
- View/download PDF
38. Ensuring Liveness Properties of Distributed Systems (A Research Agenda)
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.3.1 - Abstract
Often fairness assumptions need to be made in order to establish liveness properties of distributed systems, but in many situations these lead to false conclusions. This document presents a research agenda aiming at laying the foundations of a theory of concurrency that is equipped to ensure liveness properties of distributed systems without making fairness assumptions. This theory will encompass process algebra, temporal logic and semantic models, as well as treatments of real-time. The agenda also includes developing a methodology that allows successful application of this theory to the specification, analysis and verification of realistic distributed systems, including routing protocols for wireless networks. Contemporary process algebras and temporal logics fail to make distinctions between systems of which one has a crucial liveness property and the other does not, at least when assuming justness, a strong progress property, but not assuming fairness. Setting up an alternative framework involves giving up on identifying strongly bisimilar systems, inventing new induction principles, developing new axiomatic bases for process algebras and new congruence formats for operational semantics, and creating new treatments of time and probability. Even simple systems like fair schedulers or mutual exclusion protocols cannot be accurately specified in standard process algebras (or Petri nets) in the absence of fairness assumptions. Hence the work involves the study of adequate language or model extensions, and their expressive power.
- Published
- 2017
39. Analysing Mutual Exclusion using Process Algebra with Signals
- Author
-
Dyseryn, Victor, van Glabbeek, Rob, and Höfner, Peter
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 - Abstract
In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar process algebras lack the expressive power to accurately capture mutual exclusion protocols without enriching the language with fairness assumptions. Adding a fairness assumption to implement a mutual exclusion protocol seems counter-intuitive. We employ a signalling operator, which can be combined with CCS, or other process calculi, and show that this minimal extension is expressive enough to model mutual exclusion: we confirm the correctness of Peterson's mutual exclusion algorithm for two processes, as well as Lamport's bakery algorithm, under reasonable assumptions on the underlying memory model. The correctness of Peterson's algorithm for more than two processes requires stronger, less realistic assumptions on the underlying memory model., Comment: In Proceedings EXPRESS/SOS 2017, arXiv:1709.00049
- Published
- 2017
- Full Text
- View/download PDF
40. Lean and Full Congruence Formats for Recursion
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 - Abstract
In this paper I distinguish two (pre)congruence requirements for semantic equivalences and preorders on processes given as closed terms in a system description language with a recursion construct. A lean congruence preserves equivalence when replacing closed subexpressions of a process by equivalent alternatives. A full congruence moreover allows replacement within a recursive specification of subexpressions that may contain recursion variables bound outside of these subexpressions. I establish that bisimilarity is a lean (pre)congruence for recursion for all languages with a structural operational semantics in the ntyft/ntyxt format. Additionally, it is a full congruence for the tyft/tyxt format., Comment: To appear in: Proc. LICS'17, Reykjavik, Iceland, IEEE
- Published
- 2017
41. Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack
- Author
-
van Glabbeek, Rob and Höfner, Peter
- Subjects
Computer Science - Logic in Computer Science ,Computer Science - Networking and Internet Architecture - Abstract
We present a formal model for a fragmentation and a reassembly protocol running on top of the standardised CAN bus, which is widely used in automotive and aerospace applications. Although the CAN bus comes with an in-built mechanism for prioritisation, we argue that this is not sufficient and provide another protocol to overcome this shortcoming., Comment: In Proceedings MARS 2017, arXiv:1703.05812
- Published
- 2017
- Full Text
- View/download PDF
42. A Branching Time Model of CSP
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science - Abstract
I present a branching time model of CSP that is finer than all other models of CSP proposed thus far. It is obtained by taking a semantic equivalence from the linear time - branching time spectrum, namely divergence-preserving coupled similarity, and showing that it is a congruence for the operators of CSP. This equivalence belongs to the bisimulation family of semantic equivalences, in the sense that on transition systems without internal actions it coincides with strong bisimilarity. Nevertheless, enough of the equational laws of CSP remain to obtain a complete axiomatisation for closed, recursion-free terms., Comment: Dedicated to Bill Roscoe, on the occasion of his 60th birthday
- Published
- 2017
- Full Text
- View/download PDF
43. An Algebraic Treatment of Recursion
- Author
-
van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science - Abstract
I review the three principal methods to assign meaning to recursion in process algebra: the denotational, the operational and the algebraic approach, and I extend the latter to unguarded recursion., Comment: Dedicated to Jan Bergstra, at the occasion of his 65th birthday and retirement
- Published
- 2017
44. Comparing the expressiveness of the $$\pi $$-calculus and CCS
- Author
-
van Glabbeek, Rob, primary
- Published
- 2022
- Full Text
- View/download PDF
45. Fair Must Testing for I/O Automata
- Author
-
van Glabbeek, Rob, primary
- Published
- 2022
- Full Text
- View/download PDF
46. Shoggoth: A Formal Foundation for Strategic Rewriting
- Author
-
Qin, Xueying, primary, O’Connor, Liam, additional, van Glabbeek, Rob, additional, Höfner, Peter, additional, Kammar, Ohad, additional, and Steuwer, Michel, additional
- Published
- 2024
- Full Text
- View/download PDF
47. MALL proof nets identify proofs modulo rule commutation
- Author
-
van Glabbeek, Rob and Hughes, Dominic
- Subjects
Computer Science - Logic in Computer Science ,F.4.1 - Abstract
We show that the proof nets introduced in [Hughes & van Glabbeek 2003, 2005] for MALL (Multiplicative Additive Linear Logic, without units) identify cut-free proofs modulo rule commutation: two cut-free proofs translate to the same proof net if and only if one can be obtained from the other by a succession of rule commutations. This result holds with and without the mix rule, and we extend it with cut.
- Published
- 2016
48. A Timed Process Algebra for Wireless Networks
- Author
-
Bres, Emile, van Glabbeek, Rob, and Höfner, Peter
- Subjects
Computer Science - Logic in Computer Science ,Computer Science - Networking and Internet Architecture ,F.3.2 ,F.3.1 ,C.2.2 - Abstract
This paper proposes a timed process algebra for wireless networks, an extension of the Algebra for Wireless Networks. It combines treatments of local broadcast, conditional unicast and data structures, which are essential features for the modelling of network protocols. In this framework we model and analyse the Ad hoc On-Demand Distance Vector routing protocol, and show that, contrary to claims in the literature, it fails to be loop free. We also present boundary conditions for a fix ensuring that the resulting protocol is indeed loop free., Comment: An extended abstract of this paper---everything but the appendices---appeared in Proc. ESOP'16. arXiv admin note: text overlap with arXiv:1312.7645
- Published
- 2016
- Full Text
- View/download PDF
49. Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity
- Author
-
Fokkink, Wan and van Glabbeek, Rob
- Subjects
Computer Science - Logic in Computer Science ,F.3.2 ,D.3.1 ,F.4.1 - Abstract
Earlier we presented a method to decompose modal formulas for processes with the internal action $\tau$, and congruence formats for branching and $\eta$-bisimilarity were derived on the basis of this decomposition method. The idea is that a congruence format for a semantics must ensure that the formulas in the modal characterisation of this semantics are always decomposed into formulas that are again in this modal characterisation. In this follow-up paper the decomposition method is enhanced to deal with modal characterisations that contain a modality $\langle\epsilon\rangle\langle a\rangle\phi$, to derive congruence formats for delay and weak bisimilarity., Comment: An extended abstract of this paper appeared in Proc. LICS'16. With Definition 20.4b(i) as formulated originally [v1], Proposition 5 does not hold. A corrected Definition 20.4b appears in this revision [v2]
- Published
- 2016
- Full Text
- View/download PDF
50. Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops
- Author
-
van Glabbeek, Rob, Höfner, Peter, Tan, Wee Lum, and Portmann, Marius
- Subjects
Computer Science - Networking and Internet Architecture ,Computer Science - Logic in Computer Science ,C.2.2 ,F.3.1 - Abstract
In the area of mobile ad-hoc networks and wireless mesh networks, sequence numbers are often used in routing protocols to avoid routing loops. It is commonly stated in protocol specifications that sequence numbers are sufficient to guarantee loop freedom if they are monotonically increased over time. A classical example for the use of sequence numbers is the popular Ad hoc On-Demand Distance Vector (AODV) routing protocol. The loop freedom of AODV is not only a common belief, it has been claimed in the abstract of its RFC and at least two proofs have been proposed. AODV-based protocols such as AODVv2 (DYMO) and HWMP also claim loop freedom due to the same use of sequence numbers. In this paper we show that AODV is not a priori loop free; by this we counter the proposed proofs in the literature. In fact, loop freedom hinges on non-evident assumptions to be made when resolving ambiguities occurring in the RFC. Thus, monotonically increasing sequence numbers, by themselves, do not guarantee loop freedom., Comment: arXiv admin note: text overlap with arXiv:1312.7645
- Published
- 2015
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.