382 search results - page 71 / 77 » Checking Interval Based Properties for Reactive Systems |
138
Voted
LATA
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
140
click to vote
FORMATS
2003
Springer
15 years 8 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
112
click to vote
CAV
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
123
click to vote
ICLP
2007
Springer
15 years 7 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
129
click to vote
JAPLL
2010
15 years 1 months ago
2010
Two currently active strands of research on logics for multi-agent systems are dynamic epistemic logic, focusing on the epistemic consequences of actions, and logics of coalitiona...