Results 21 to 30 of about 2,934 (199)

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

The Expansion Problem for Infinite Trees [PDF]

Logical Methods in Computer Science
We study Ramsey like theorems for infinite trees and similar combinatorial tools. As an application we consider the expansion problem for tree algebras.
Achim Blumensath
doaj   +1 more source

Extended Stone Duality via Monoidal Adjunctions [PDF]

Logical Methods in Computer Science
Extensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental in proving results in algebraic language theory.
Fabian Lenke, Henning Urbat, Stefan Milius   +2 more
doaj   +1 more source

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

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

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

A Robust Class of Context-Sensitive Languages

, 2007
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations.
MADHUSUDAN P, Torre, Salvatore La, Parlato, Gennaro, SALVATORE LA TORRE, P. MADHUSUDAN, Parthasarathy Madhusudan, Gennaro Parlato, Madhusudan, Parthasarathy, LA TORRE, Salvatore   +8 more
core   +2 more sources

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

The Language Theory of Bounded Context-Switching

, 2010
Concurrent compositions of recursive programs with finite data are a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form of reachability has become popular in the formal verification ...
Salvatore La Torre, Parlato, Gennaro, La Torre, Salvatore, G. Parlato, Parthasarathy Madhusudan, Madhusudan, P., P. Madhusudan, Gennaro Parlato, S. La Torre   +8 more
core   +2 more sources