Maurice H. ter Beek, Jetty Kleijn  Home/Search
Context Related
| wi.leidenuniv.nl/~mtbeek/cg.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wi.leidenuniv.nl/~mtbeek...scicv (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A team automaton is said to satisfy compositionality if its behaviour can be described in terms of the behaviour of its constituting component automata. As an initial investigation of the conditions under which team automata satisfy compositionality, we study their computations and behaviour in relation to those of their constituting component automata. We show that the construction of team automata according to certain natural types of synchronization guarantees compositionality. (Update)
Cited by: More
Team Automata for Security Analysis - Beek, Lenzini, al. (Correct)
Active bibliography (related documents): More All
0.5: Teams of Pushdown Automata - Maurice Ter Beek (Correct)
0.5: Synchronized Shuffle and Regular Languages - Latteux, Roos (1999) (Correct)
0.4: Team Automata for Security Analysis of.. - Beek, Lenzini, Petrocchi (Correct)
Similar documents based on text: More All
0.5: Synchronizations in Team Automata for Groupware Systems - Beek, Ellis (1999) (Correct)
0.4: Teams in Grammar Systems - Beek (1996) (Correct)
0.4: Team Automata for CSCW - Beek, Ellis, Kleijn, Rozenberg (2001) (Correct)
Related documents from co-citation: More All
2: Vector Controlled Concurrent Systems (context) - Keesmaat - 1996
BibTeX entry: (Update)
M.H. ter Beek and J. Kleijn. Team Automata Satisfying Compositionality. In Proc. FME'03, LNCS 2805, pages 381--400, 2003. http://citeseer.ist.psu.edu/terbeek03team.html More
@misc{ beek03team,
author = "M. Beek and J. Kleijn",
title = "Team Automata Satisfying Compositionality",
text = "M.H. ter Beek and J. Kleijn. Team Automata Satisfying Compositionality.
In Proc. FME'03, LNCS 2805, pages 381--400, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/terbeek03team.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1174 Statecharts: A Visual Formalism for Complex Systems - Harel - 1987
293 Hierarchical Correctness Proofs for Distributed Algorithms - Tuttle - 1987
220 Formal Languages (context) - Salomaa - 1973
195 The Theory and Practice of Concurrency (context) - Roscoe - 1997
139 Introduction to InputOutput Automata (context) - Tuttle, to et al. - 1989
30 the Power of Bounded Concurrency I: Finite Automata - Drusinsky, Harel - 1994
11 Team Automata for Groupware Systems (context) - Ellis - 1997
9 the Power of Bounded Concurrency II: Pushdown Automata (context) - Hirst, Harel - 1994
9 Synchronizations in team automata for groupware systems - Beek, Ellis et al. - 2003
8 Timed Cooperating Automata - Lanotte, Maggiolo-Schettini et al. - 2000
4 A Formal Approach to the Modeling of Collaboration Between S.. (context) - Beek, Automata - 2003
4 Mappings of Languages by Two-Tape Devices (context) - Ginsburg, Spanier - 1965
3 Compositional Veri cation of Distributed Systems (context) - Jonsson - 1987
3 Compositional Speci cation and Veri cation of Distributed Sy.. (context) - Jonsson - 1994
3 Trace Theory and VLSI Design (context) - Snepscheut - 1985
3 The Power of Synchronizing Operations on Strings (context) - Jantzen - 1981
2 An Algebraic System for Process Structuring and Interprocess.. (context) - Kimura - 1976
2 Formal Security Analysis with Interacting State Machines (context) - von Oheimb, Lotz - 2002
1 InputOutput Compatibility Reactive System - Cortadella, Compatibility et al. - 2002
1 Langages In nitaires et Produit de Mixage (context) - De Simone - 1984
1 Interacting State Machines: A Stateful Approach to Proving S.. (context) - von Oheimb - 2003
1 Handbook of Process Algebra (context) - Process, Ponse et al. - 2001
1 Team Automata for CSCW (context) - Beek, Ellis et al. - 2001
1 and Regular Languages (context) - Latteux, Roos et al. - 1999
1 Synthesis of Reactive Systems: Application to Asynchronous C.. (context) - Carmona, Cortadella et al. - 2002
Documents on the same site (http://www.wi.leidenuniv.nl/~mtbeek/sci-cv.html): More
Teams in Grammar Systems: Hybridity and Weak Rewriting - Beek (1996) (Correct)
Teams in Grammar Systems: Sub-Context-Free Cases - Beek (1997) (Correct)
Simple Eco-Grammar Systems With Prescribed Teams - Beek (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC