921 search results - page 131 / 185 » On Interleaving in Timed Automata |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
ENTCS
2008
14 years 12 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
ENTCS
2006
14 years 12 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
127
click to vote
IPL
2008
14 years 12 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
PADS
2003
ACM
15 years 5 months ago
2003
ACM
This paper presents Maya, a multi-paradigm, scalable and extensible network modeling framework for emulating distributed applications. A novel three-tier architecture is proposed ...