Sciweavers

655 search results - page 16 / 131
» Automata, Logic, and XML
Sort
View
FMCAD
2006
Springer
15 years 1 months ago
Optimizations for LTL Synthesis
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
Barbara Jobstmann, Roderick Bloem
CADE
2006
Springer
15 years 10 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
BXML
2003
14 years 11 months ago
Rule-Based Generation of XML Schemas from UML Class Diagrams
We present an approach of how to automatically extract an XML document structure from a conceptual data model that describes the content of the document. We use UML class diagrams ...
Tobias Krumbein, Thomas Kudrass
ENTCS
2007
156views more  ENTCS 2007»
14 years 9 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
CONCUR
2010
Springer
14 years 10 months ago
Modal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
Cristian Prisacariu