759 search results - page 18 / 152 » Overlap-Free Regular Languages |
134
Voted
CONCUR
2004
Springer
15 years 10 months ago
2004
Springer
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
144
Voted
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
147
click to vote
ICTAC
2007
Springer
15 years 11 months ago
2007
Springer
We present regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability to use regular expressions arbitrarily as sub-expressions. Every LT...
134
click to vote
ATVA
2009
Springer
15 years 9 months ago
2009
Springer
We present specification languages that naturally capture exactly the regular and -regular properties that are stutter invariant. Our specification languages are variants of the cl...
124
click to vote
INFORMATICALT
2002
15 years 4 months ago
2002
In this paper we consider non-deterministic finite Rabin