71 search results - page 5 / 15 » A Calculus for Team Automata |
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients...
IANDC
2010
13 years 6 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
FM
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. The design of controllers for hybridsystems i.e. mixeddiscretecontinuous systems in a systematic manner remains a challenging task. In this case study, we apply formal m...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
ICALP
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...