311 search results - page 15 / 63 » A Bialgebraic Approach to Automata and Formal Language Theor... |
ESWS
2010
Springer
13 years 7 months ago
2010
Springer
Recent work in Ontology learning and Text mining has mainly focused on engineering methods to solve practical problem. In this thesis, we investigate methods that can substantially...
ASE
2002
13 years 8 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
SAS
1999
Springer
14 years 28 days ago
1999
Springer
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
HYBRID
2007
Springer
14 years 2 months ago
2007
Springer
We propose the use of formal languages of infinite words over the alphabet of task identifiers as an interface between control designs and software implementations. We argue that...
ESORICS
2002
Springer
14 years 8 months ago
2002
Springer
We introduce the ISM approach, a framework for modeling and verifying reactive systems in a formal, even machine-checked, way. The framework has been developed for applications in ...