30 search results - page 1 / 6 » Model Checking for Nominal Calculi |
FOSSACS
2005
Springer
13 years 10 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
LISP
2006
13 years 4 months ago
2006
In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
ENTCS
2007
13 years 4 months ago
2007
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper,Multiple Labelled Transit...