Sciweavers

206 search results - page 16 / 42
» Regular Expressions into Finite Automata
Sort
View
VMCAI
2010
Springer
14 years 3 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker
ICWS
2004
IEEE
13 years 9 months ago
Transforming BPEL into Annotated Deterministic Finite State Automata for Service Discovery
Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services. The reason for this limitation is the lack of a met...
Andreas Wombacher, Peter Fankhauser, Erich J. Neuh...
CC
2005
Springer
195views System Software» more  CC 2005»
13 years 10 months ago
Compilation of Generic Regular Path Expressions Using C++ Class Templates
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...
Luca Padovani
SBMF
2010
Springer
164views Formal Methods» more  SBMF 2010»
13 years 3 months ago
A Decision Procedure for Bisimilarity of Generalized Regular Expressions
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Io...
DLT
2003
13 years 9 months ago
On Deterministic Finite Automata and Syntactic Monoid Size, Continued
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
Markus Holzer, Barbara König