Results 21 to 30 of about 2,538 (309)

Separation Property for wB- and wS-regular Languages [PDF]

Logical Methods in Computer Science, 2014
In this paper we show that {\omega}B- and {\omega}S-regular languages satisfy the following separation-type theorem If L1,L2 are disjoint languages of {\omega}-words both recognised by {\omega}B- (resp.
Michał Skrzypczak
doaj   +1 more source

Parametric updates in parametric timed automata [PDF]

Logical Methods in Computer Science, 2021
We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters.
Étienne André, Didier Lime, Mathias Ramparison   +2 more
doaj   +1 more source

Avoiding Shared Clocks in Networks of Timed Automata [PDF]

Logical Methods in Computer Science, 2013
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks, i.e.
Sandie Balaguer, Thomas Chatain
doaj   +1 more source

Connector algebras for C/E and P/T nets' interactions [PDF]

Logical Methods in Computer Science, 2013
A quite flourishing research thread in the recent literature on component-based systems is concerned with the algebraic properties of different classes of connectors.
Roberto Bruni, Hernan Melgratti, Ugo Montanari, Pawel Sobocinski   +3 more
doaj   +1 more source

Watson-Crick conjugates of words and languages [PDF]

Discrete Mathematics & Theoretical Computer Science
In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages.
Kalpana Mahalingam, Anuran Maity
doaj   +1 more source

On the expressiveness of spider diagrams and commutative star-free regular languages [PDF]

, 2013
Spider diagrams provide a visual logic to express relations between sets and their elements, extending the expressiveness of Venn diagrams. Sound and complete inference systems for spider diagrams have been developed and it is known that they are ...
Taylor, John, Delaney, Aidan, Thompson, Simon, Stapleton, Gem   +3 more
core   +1 more source

Minimisation of Multiplicity Tree Automata [PDF]

Logical Methods in Computer Science, 2017
We consider the problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polynomial time assuming unit-cost arithmetic.
Stefan Kiefer, Ines Marusic, James Worrell   +2 more
doaj   +1 more source

Regular tree languages in low levels of the Wadge Hierarchy [PDF]

Logical Methods in Computer Science, 2019
In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the ...
Mikołaj Bojańczyk, Filippo Cavallari, Thomas Place, Michał Skrzypczak   +3 more
doaj   +1 more source

History−Register Automata [PDF]

, 2013
Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling such programs. HRAs
Tzevelekos, Nikos, Grigore, R, Tzevelekos, N, Nikos Tzevelekos, Grigore, Radu, Radu Grigore   +5 more
core   +1 more source

Computing the Width of Non-deterministic Automata [PDF]

Logical Methods in Computer Science, 2019
We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any ...
Denis Kuperberg, Anirban Majumdar
doaj   +1 more source