3653 search results - page 216 / 731 » On Recognizable Timed Languages |
238
click to vote
POPL
2008
ACM
16 years 5 months ago
2008
ACM
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
151
click to vote
ICCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Bulk-Synchronous Parallel ML (BSML) is a functional dataparallel language to code Bulk-Synchronous Parallel (BSP) algorithms. It allows an estimation of execution time, a...
126
Voted
VL
2003
IEEE
15 years 10 months ago
2003
IEEE
The recent major revision of the UML (see [4]) has introduced significant changes and additions. In particular, Message Sequence Charts (MSC) according to the ISO standard (see [...
146
click to vote
CONCUR
1998
Springer
15 years 9 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
144
Voted
ICALP
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this pa...