81 search results - page 13 / 17 » A Formalisation of Finite Automata Using Hereditarily Finite... |
75
Voted
CONCUR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
SIGSOFT
2009
ACM
15 years 10 months ago
2009
ACM
Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and timecons...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
AIPS
2010
14 years 12 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
79
Voted
QEST
2010
IEEE
14 years 7 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...