Results 271 to 280 of about 413,827 (305)
Some of the next articles are maybe not open access.
1998
In this paper, we consider the problem verifying hybrid systems modelled by linear hybrid automata. We extend the traditional regular expressions with time constraints and use them as a language to describe the behaviour of a class of linear hybrid automata. The extended notation is called Hybrid Regular Expression (HRE).
Xuandong Li +4 more
openaire +1 more source
In this paper, we consider the problem verifying hybrid systems modelled by linear hybrid automata. We extend the traditional regular expressions with time constraints and use them as a language to describe the behaviour of a class of linear hybrid automata. The extended notation is called Hybrid Regular Expression (HRE).
Xuandong Li +4 more
openaire +1 more source
New Algorithms for Regular Expression Matching
Lecture Notes in Computer Science, 2006 . In this paper we revisit the classical regular expression matching problem, namely, given a regular expression R and a string Q consisting of m and n symbols, respectively, decide if Q matches one of the strings specified by R.
Philip Bille
exaly +2 more sources
2013
Most software packages with regular expression matching engines offer operators that extend the classical regular expressions, such as counting, intersection, complementation, and interleaving. Some of the most popular engines, for example those of Java and Perl, also provide operators that are intended to control the nondeterminism inherent in regular
Martin Berglund +4 more
openaire +1 more source
Most software packages with regular expression matching engines offer operators that extend the classical regular expressions, such as counting, intersection, complementation, and interleaving. Some of the most popular engines, for example those of Java and Perl, also provide operators that are intended to control the nondeterminism inherent in regular
Martin Berglund +4 more
openaire +1 more source
Regular Expressions for PCTL Counterexamples
2008 Fifth International Conference on Quantitative Evaluation of Systems, 2008Counterexamples for probabilistic reachability in Markov chains are sets of paths that all reach a goal state and whose cumulative likelihood exceeds a threshold. This paper is concerned with the issue of how to conveniently represent these sets. Experiments, partially substantiated with combinatorial arguments, show that the cardinality of such sets ...
Berteun Damman +2 more
openaire +1 more source
A Survey of Regular Expressions and Their Applications
IRE Transactions on Electronic Computers, 1962This paper is an exposition of the theory of regular expressions and its applications to sequential circuits. The results of several authors are presented in a unified manner, pointing out the similarities and differences in the various treatments of the subject. Whenever possible, the terminology and notation of sequential circuit theory are used. The
openaire +2 more sources
Formalising and implementing Boost POSIX regular expression matching
Theoretical Computer Science, 2021Martin Berglund +2 more
exaly
Proceedings of the sixth international conference on Information and knowledge management, 1997
Ken Nakayama +2 more
openaire +1 more source
Ken Nakayama +2 more
openaire +1 more source