644 search results - page 12 / 129 » Precedence Automata and Languages |
CONCUR
2001
Springer
13 years 12 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
IMSCCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
Security automata are a variant of B¨uchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, ...
CONCUR
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...