API generation for multiparty session types, revisited and revised using scala 3
Construction and analysis of distributed systems is difficult. Multiparty session types (MPST)
constitute a method to make it easier. The idea is to use type checking to statically prove …
constitute a method to make it easier. The idea is to use type checking to statically prove …
Kleene Theorem for Higher-Dimensional Automata
We prove a Kleene theorem for higher-dimensional automata. It states that the languages
they recognise are precisely the rational subsumption-closed sets of finite interval pomsets …
they recognise are precisely the rational subsumption-closed sets of finite interval pomsets …
[HTML][HTML] Branching pomsets: design, expressiveness and applications to choreographies
Choreographic languages describe possible sequences of interactions among a set of
agents. Typical models are based on languages or automata over sending and receiving …
agents. Typical models are based on languages or automata over sending and receiving …
CALF: categorical automata learning framework
Automata learning is a technique that has successfully been applied in verification, with the
automaton type varying depending on the application domain. Adaptations of automata …
automaton type varying depending on the application domain. Adaptations of automata …
Stream Types
We propose a rich foundational theory of typed data streams and stream transformers,
motivated by two high-level goals. First, the type of a stream should be able to express …
motivated by two high-level goals. First, the type of a stream should be able to express …
Stream types
We propose a rich foundational theory of typed data streams and stream transformers,
motivated by two high-level goals:(1) The type of a stream should be able to express …
motivated by two high-level goals:(1) The type of a stream should be able to express …
Realisability of branching pomsets
L Edixhoven, SS Jongmans - … on Formal Aspects of Component Software, 2022 - Springer
A communication protocol is realisable if it can be faithfully implemented in a distributed
fashion by communicating agents. Pomsets offer a way to compactly represent concurrency …
fashion by communicating agents. Pomsets offer a way to compactly represent concurrency …
[PDF][PDF] Learning Pomset Automata.
Learning Pomset Automata. Page 524 Learning Pomset Automata ⋆ Gerco van Heerdt1(),
Tobias Kappé2, Jurriaan Rot3, and Alexandra Silva1 1 University College London, London, UK …
Tobias Kappé2, Jurriaan Rot3, and Alexandra Silva1 1 University College London, London, UK …
[PDF][PDF] Realisability of branching pomsets (technical report)
LJ Edixhoven, SS Jongmans - 2022 - research.ou.nl
A communication protocol is realisable if it can be faithfully implemented in a distributed
fashion by communicating agents. Pomsets offer a way to compactly represent concurrency …
fashion by communicating agents. Pomsets offer a way to compactly represent concurrency …
Active Learning Techniques for Pomset Recognizers
Pomsets are a promising formalism for concurrent programs based on partially ordered sets.
Among this class, series-parallel pomsets admit a convenient linear representation and can …
Among this class, series-parallel pomsets admit a convenient linear representation and can …