Results 1 - 10 of 11

Querying linguistic treebanks with monadic second-order logic in linear time

by Hendrik Maryns, Stephan Kepser - Journal of Logic, Language, and Information , 2004
"... MonaSearch is a new powerful query tool for linguistic treebanks. The query language of MonaSearch is monadic second-order logic, an extension of first-order logic capable of expressing probably all linguis-tically interesting queries. In order to process queries efficiently, they are compiled into ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
into tree automata. A treebank is queried by checking whether the automaton representing the query accepts the tree, for each tree. Experiments show that even complex queries can be exe-cuted very efficiently. The tree automaton toolkit MONA is used for the computation of the automata. 1

MonaSearch – A Tool for Querying Linguistic

by Hendrik Maryns, Stephan Kepser
"... MonaSearch is a new powerful query tool for linguistic treebanks. The query language of MonaSearch is monadic second-order logic, an extension of first-order logic capable of expressing probably all linguistically interest-ing queries. In order to process queries efficiently, they are compiled into ..."
Abstract - Add to MetaCart
into tree automata. A treebank is queried by checking whether the automaton repres-enting the query accepts the tree, for each tree. Experiments show that even complex queries can be executed very efficiently. The tree automaton toolkit MONA is used for the computation of the automata. 1

Revisiting multi-tape automata for Semitic morphological analysis and generation

by Mans Hulden
"... Various methods have been devised to produce morphological analyzers and generators for Semitic languages, ranging from methods based on widely used finitestate technologies to very specific solutions designed for a specific language or problem. Since the earliest proposals of how to adopt the elsew ..."
Abstract - Add to MetaCart
, and hence such technology has not been readily available to linguists. This paper, using an actual Arabic grammar as a case study, describes an approach to encoding multi-tape automata on a single tape that can be implemented using any standard finite-automaton toolkit. 1

Simulating Nondeterministic Systems at Multiple Levels of Abstraction

by Dilsun Kirl Kaynar, Anna Chefter, Laura Dean, Stephen J. Garland, Nancy A. Lynch, Toh Ne Win, Antonio Ramírez-Robredo - LAB
"... IOA is a high-level distributed programming language based on the formal I/O automaton model for asynchronous concurrent systems. A suite of software tools, called the IOA toolkit, has been designed and partially implemented to facilitate the analysis and verification of distributed systems using te ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
IOA is a high-level distributed programming language based on the formal I/O automaton model for asynchronous concurrent systems. A suite of software tools, called the IOA toolkit, has been designed and partially implemented to facilitate the analysis and verification of distributed systems using

The IOA Simulator

by Dilsun Kirl Kaynar, Anna Chefter, Laura Dean, Stephen Garland, Nancy Lynch, Toh Ne Win, Antonio Ramírez-Robredo , 2002
"... IOA is a high-level distributed programming language based on the formal I/O automaton model for asynchronous concurrent systems. A suite of software tools, called the IOA toolkit, has been designed and partially implemented to facilitate the analysis and verification of systems using techniques sup ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
IOA is a high-level distributed programming language based on the formal I/O automaton model for asynchronous concurrent systems. A suite of software tools, called the IOA toolkit, has been designed and partially implemented to facilitate the analysis and verification of systems using techniques

Model checking for nominal calculi

by Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto - IN FOSSACS, VOLUME 3441 OF LNCS , 2005
"... Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model checking a difficult task. In this note we survey some of the approaches for model checking nominal calculi. Then, we f ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
focus on History-Dependent automata, a syntax-free automaton-based model of mobility. History-Dependent automata have provided the formal basis to design and implement some existing verification toolkits. We then introduce a novel syntax-free setting to model the symbolic semantics of a nominal calculus

CNRS and the University of Grenoble-Alpes

by Oded Maler, Olivier Lebeltel, Ouri Maler
"... Abstract. In this work we propose a model that can be used to study the dynam-ics of mass action systems, systems consisting of a large number of individuals whose behavior is influenced by other individuals that they encounter. Our ap-proach is rather synthetic and abstract, viewing each individual ..."
Abstract - Add to MetaCart
individual as a probabilistic automaton that can be in one of finitely many discrete states. We demonstrate the type of investigations that can be carried out on such a model using the Populus toolkit. In particular, we illustrate how sensitivity to initial spatial distribution can be observed in simulation

Compiling IOA without global synchronization

by Joshua A. Tauber, Nancy A. Lynch, Michael J. Tsai - In Proceedings of the The 3rd IEEE International Symposium on Network Computing and Applications, (IEEE NCA04 , 2004
"... This paper presents a strategy for compiling distributed systems specified in IOA, a formal language for describing such systems as I/O automata, into Java programs running on a group of networked workstations. The translation works node-by-node, translating IOA programs into Java classes that commu ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
of the network, the compilation method preserves safety properties of the IOA program in the generated Java code. We model the generated Java code itself as a threaded, low-level I/O automaton and use a refinement mapping to show that the external behavior of the system is preserved by the translation. The IOA

GEAMAS V2.0: an Object Oriented Platform for Complex Systems Simulations.

by Jc Souli Marcenac, P. Marcenac, S. Calderoni, R. Courdier
"... This paper presents the object oriented design and implementation of GEAMAS V2.0, a toolkit for virtual simulations of complex systems. GEAMAS V2.0 is structured in three modules: the Kernel, the Generation Environment and the Simulation Environment. The Kernel implements an object model for agents ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper presents the object oriented design and implementation of GEAMAS V2.0, a toolkit for virtual simulations of complex systems. GEAMAS V2.0 is structured in three modules: the Kernel, the Generation Environment and the Simulation Environment. The Kernel implements an object model for agents

The reactive engine for modular transducers

by Gérard Huet, Benoît Razet - Algebra, Meaning and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday , 2005
"... Abstract. This paper explains the design of the second release of the Zen toolkit [5–7]. It presents a notion of reactive engine which simulates finite-state machines represented as shared aums [8]. We show that it yields a modular interpreter for finite state machines described as local transducers ..."
Abstract - Cited by 11 (9 self) - Add to MetaCart
Abstract. This paper explains the design of the second release of the Zen toolkit [5–7]. It presents a notion of reactive engine which simulates finite-state machines represented as shared aums [8]. We show that it yields a modular interpreter for finite state machines described as local
Results 1 - 10 of 11