73 search results - page 5 / 15 » Products of Tree Automata with an Application to Temporal Lo... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
ATVA
2008
Springer
13 years 9 months ago
2008
Springer
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
ICECCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we summarize parallel algorithms for enumerative model checking of properties formulated in linear time temporal logic (LTL) as well as a fragment of the µcalculus ...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...