Results 21 to 30 of about 45,230 (224)
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é +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 +3 more
doaj +1 more source
Watson-Crick conjugates of words and languages [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn 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
A prolog toolkit for formal languages and automata [PDF]
ACM SIGCSE Bulletin, 2005 This paper describes the first version of PFLAT (read "P flat"), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms taught in Formal Languages and Automata Theory (FLAT) courses. By ``pedagogical implementation'' we mean on the one hand that students should be able to easily map the ...
Wermelinger, Michel, Dias, Artur Miguel
openaire +2 more sources
Distributed Graph Automata and Verification of Distributed Algorithms [PDF]
, 2014 Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic.
Reiter, Fabian
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 +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 +3 more
doaj +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
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems [PDF]
Logical Methods in Computer Science, 2016 A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(
Florent Jacquemard +2 more
doaj +1 more source