Sciweavers

Share
TCS
2002
9 years 3 months ago
A truly concurrent semantics for a process algebra using resource pomsets
In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allo...
Paul Gastin, Michael W. Mislove
ITA
2007
9 years 3 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
IANDC
2006
95views more  IANDC 2006»
9 years 3 months ago
The alternation hierarchy in fixpoint logic with chop is strict too
Fixpoint Logic with Chop extends the modal
Martin Lange
books