27 search results - page 2 / 6 » Nominal Domain Theory for Concurrency |
LATIN
2010
Springer
14 years 4 days ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
AGP
2010
IEEE
13 years 3 months ago
2010
IEEE
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
FOSSACS
2000
Springer
13 years 9 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Coalgebras are categorical presentations of state-based systems. In investigating parallel composition of coalgebras (realizing concurrency), we observe that the same alg...
FUIN
2010
13 years 2 months ago
2010
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper ...