Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Pietro, Pierluigi San"'
We propose different ways of lifting the notion of Dyck language from words to 2-dimensional (2D) pictures, by means of new definitions of increasing comprehensiveness. Two of the proposals are based on alternative definitions of a Dyck language, whi
Externí odkaz:
http://arxiv.org/abs/2307.16522
A recognizable picture language is defined as the projection of a local picture language defined by a set of two-by-two tiles, i.e. by a strictly-locally-testable (SLT) language of order 2. The family of recognizable picture languages is also defined
Externí odkaz:
http://arxiv.org/abs/2206.05208
Timed Automata (TA) are a very popular modeling formalism for systems with time-sensitive properties. A common task is to verify if a network of TA satisfies a given property, usually expressed in Linear Temporal Logic (LTL), or in a subset of Timed
Externí odkaz:
http://arxiv.org/abs/2104.12444
Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalism is mostly used for checking whether the behaviours of a system satis
Externí odkaz:
http://arxiv.org/abs/1806.08684
The memory of a deque (double ended queue) automaton is more general than a queue or two stacks; to avoid overgeneralization, we consider quasi-real-time operation. Normal forms of such automata are given. Deque languages form an AFL but not a full o
Externí odkaz:
http://arxiv.org/abs/1806.06562
The famous theorem by Chomsky and Sch\"utzenberger (CST) says that every context-free language $L$ over an alphabet $\Sigma$ is representable as $h(D \cap R)$, where $D$ is a Dyck language over a set $\Omega$ of brackets, $R$ is a local language and
Externí odkaz:
http://arxiv.org/abs/1805.04003
Publikováno v:
EPTCS 256, 2017
This volume contains the proceedings of the Eighth International Symposium on Games, Automata, Logic and Formal Verification (GandALF 2017). The symposium took place in Roma, Italy, from the 20th to the 22nd of September 2017. The GandALF symposium w
Externí odkaz:
http://arxiv.org/abs/1709.01761
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bersani, Marcello M., Bianculli, Domenico, Ghezzi, Carlo, Krstic, Srdan, Pietro, Pierluigi San
The problem of checking a logged event trace against a temporal logic specification arises in many practical cases. Unfortunately, known algorithms for an expressive logic like MTL (Metric Temporal Logic) do not scale with respect to two crucial dime
Externí odkaz:
http://arxiv.org/abs/1508.06613
Service-based applications are often developed as compositions of partner services. A service integrator needs precise methods to specify the quality attributes expected by each partner service, as well as effective techniques to verify these attribu
Externí odkaz:
http://arxiv.org/abs/1409.4653