Sciweavers

11561 search results - page 284 / 2313
» Open Distributed Processing
Sort
View
CONCUR
2004
Springer
15 years 10 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
CONCUR
2008
Springer
15 years 8 months ago
A Context-Free Process as a Pushdown Automaton
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...
FLAIRS
2004
15 years 7 months ago
Constraint Processing with Reactive Agents
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...
Georg Ringwelski, Richard J. Wallace
CASCON
1993
106views Education» more  CASCON 1993»
15 years 7 months ago
The use of process clustering in distributed-system event displays
When debugging a distributed application, a display showing the events causing interactions between processes can be very useful. If the number of processes is large, displaying a...
David J. Taylor
CONCUR
2010
Springer
15 years 7 months ago
Theory by Process
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
Yuxi Fu