Treffer: Switched PIOA : Parallel composition via distributed scheduling

Title:
Switched PIOA : Parallel composition via distributed scheduling
Authors:
CHEUNG, Ling, LYNCH, Nancy, SEGALA, Roberto, VAANDRAGER, Frits
Source:
Formal methods for components and objectsTheoretical computer science. 365(1-2):83-108
Publisher Information:
Amsterdam: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 34 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Automates. Machines abstraites. Machines de turing, Automata. Abstract machines. Turing machines, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Logiciel, Software, Performances des systèmes informatiques. Fiabilité, Computer systems performance. Reliability, Automate probabiliste, Probabilistic automaton, Autómata probabilista, Compositionnalité, Compositionality, Composiciónalidad, Informatique théorique, Computer theory, Informática teórica, Sémantique, Semantics, Semántica, Automates probabilistes commutés d'entrée-sortie, Switched probabilistic input/output automata, Composition parallèle, Parallel composition, Distributed scheduling, Trace-style semantics
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, Netherlands
MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA 02139, United States
Dipartimento di Informatica, Università di Verona, Strada Le Grazie 15, 37134 Verona, Italy
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18291176
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18291176
Database:
PASCAL Archive

Weitere Informationen

This paper presents the framework of switched probabilistic input/output automata (or switched PIOA), augmenting the original PIOA framework with an explicit control exchange mechanism. Using this mechanism, we model a network of processes passing a single token among them, so that the location of this token determines which process is scheduled to make the next move. This token structure therefore implements a distributed scheduling scheme: scheduling decisions are always made by the (unique) active component. Distributed scheduling allows us to draw a clear line between local and global nondeterministic choices. We then require that local nondeterministic choices are resolved using strictly local information. This eliminates unrealistic schedules that arise under the more common centralized scheduling scheme. As a result, we are able to prove that our trace-style semantics is compositional.