71 search results - page 2 / 15 » A Calculus for Team Automata |
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
IEEEIAS
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper introduces a mathematical model, called Team Edit Automata, for evaluating software security properties. We use the model to describe security properties and their corr...
JALC
2006
13 years 5 months ago
2006
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
ENTCS
2002
13 years 5 months ago
2002
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
LACL
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...