Sciweavers

303 search results - page 33 / 61
» Automata on Gauss Words
Sort
View
ICTAC
2005
Springer
14 years 3 months ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang
FORMATS
2004
Springer
14 years 3 months ago
Learning of Event-Recording Automata
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
Olga Grinchtein, Bengt Jonsson, Martin Leucker
ARTS
1997
Springer
14 years 1 months ago
PLC-Automata: A New Class of Implementable Real-Time Automata
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Henning Dierks
ENTCS
2006
112views more  ENTCS 2006»
13 years 9 months ago
Interface Automata with Complex Actions
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
Shahram Esmaeilsabzali, Farhad Mavaddat, Nancy A. ...
JSC
2010
102views more  JSC 2010»
13 years 8 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu