13 search results - page 2 / 3 » Concurrent Automata vs. Asynchronous Systems |
PTS
2007
13 years 6 months ago
2007
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
SCP
2010
13 years 3 months ago
2010
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specifica...
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
ASP
2001
Springer
13 years 9 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
SEFM
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...