Location automata for synchronised shuffle expressions

Several notions of synchronisation in concurrent systems can be modelled by regular shuffle operators. In this paper we consider regular expressions extended with three operators corresponding respectively to strong, arbitrary, and weak synchronisation. For these expressions, we define a location ba...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 132; p. 100847
Main Authors Broda, Sabine, Machiavelo, António, Moreira, Nelma, Reis, Rogério
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.04.2023
Subjects
Locations
Partial derivatives
Position automaton
Regular expressions
Shuffle operators
Synchronisation
Locations
Shuffle operators
Regular expressions
Position automaton
Synchronisation
Partial derivatives
Online AccessGet full text

Cover

More Information
Summary:Several notions of synchronisation in concurrent systems can be modelled by regular shuffle operators. In this paper we consider regular expressions extended with three operators corresponding respectively to strong, arbitrary, and weak synchronisation. For these expressions, we define a location based position automaton. Furthermore, we show that the partial derivative automaton is still a quotient of the position automaton.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2023.100847