Sciweavers

233 search results - page 4 / 47
» Equivalent Transformations of Automata by Using Behavioural ...
Sort
View
TCS
2010
13 years 2 months ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
DMTCS
2010
137views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Deterministic recognizability of picture languages with Wang automata
We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessell...
Violetta Lonati, Matteo Pradella
HYBRID
1998
Springer
13 years 11 months ago
Equations on Timed Languages
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
Eugene Asarin
CCS
2007
ACM
14 years 1 months ago
Specifying and analyzing security automata using CSP-OZ
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, ...
David A. Basin, Ernst-Rüdiger Olderog, Paul E...
FUIN
2008
123views more  FUIN 2008»
13 years 7 months ago
Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
Shahram Esmaeilsabzali, Nancy A. Day, Farhad Mavad...