Skip to main content
2 votes

Is this a good definition of computability?

First of all, the place for this question is cs.se, not here. But since I've already written an answer, I'll leave it. There is a formal definition of computability: a function $f$ is computable if ...
Shaull's user avatar
  • 5,656
2 votes

State machine classes with sub-exponentially growing model spaces

I believe that there are no reasonable model where the number of machines grow subexponentially, in the sense that either such a model would be remarkably not expressive, or would require huge ...
Rémi's user avatar
  • 262
1 vote

What are advantages of bigraphs?

There is not one right model of computation that works at all levels of abstraction. You already see this when you compare $\pi$-calculus with Petri-nets: $\pi$ is based on binary interation, while ...
Martin Berger's user avatar
1 vote

Reference request: pi-calculus with simultaneous events

Milner defines the SCCS calculus in [1]. This is a generalization of CCS where the actions form an abelian group, and where the communication rule is defined as in my question. [1] Milner, R. Calculi ...
Ulrik Rasmussen's user avatar
1 vote

Temporal Logic and Access Control Models

There were a lot of publication on extending and or formalizing RBAC/SOD with LTL or other flavors of temporal logics, not sure of other AC models. Google Scholar (or simple google) search with yield ...
Serge's user avatar
  • 111

Only top scored, non community-wiki answers of a minimum length are eligible