Results 41 to 50 of about 4,399 (316)

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

Determinisability of register and timed automata [PDF]

Logical Methods in Computer Science, 2022
The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton.
Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski   +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

Asynchronous wreath product and cascade decompositions for concurrent behaviours [PDF]

Logical Methods in Computer Science, 2022
We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between events,
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil   +3 more
doaj   +1 more source

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]

Logical Methods in Computer Science
A characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
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

Structural Reductions and Stutter Sensitive Properties [PDF]

Logical Methods in Computer Science
Verification of properties expressed as $\omega$-regular languages such as LTL can benefit hugely from stutter insensitivity, using a diverse set of reduction strategies.
Emmanuel Paviot-Adet, Denis Poitrenaud, Etienne Renault, Yann Thierry-Mieg   +3 more
doaj   +1 more source

Completeness Theorems for Kleene algebra with tests and top [PDF]

Logical Methods in Computer Science
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of Kleene algebra ...
Damien Pous, Jana Wagemaker
doaj   +1 more source

Regular Tree Algebras [PDF]

Logical Methods in Computer Science, 2020
We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras.
Achim Blumensath
doaj   +1 more source

Quantitative Automata under Probabilistic Semantics [PDF]

Logical Methods in Computer Science, 2019
Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop   +2 more
doaj   +1 more source