Sciweavers

CONCUR
2004
Springer
13 years 9 months ago
Model Checking Timed Automata with One or Two Clocks
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
François Laroussinie, Nicolas Markey, Ph. S...
CONCUR
2004
Springer
13 years 9 months ago
Parameterised Boolean Equation Systems (Extended Abstract)
Systems (extended abstract) Simona Orzan and Tim A.C. Willemse Department of Mathematics and Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, T...
Jan Friso Groote, Tim A. C. Willemse
CONCUR
2004
Springer
13 years 9 months ago
An Extensional Spatial Logic for Mobile Processes
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual...
Daniel Hirschkoff
CONCUR
2004
Springer
13 years 9 months ago
Modular Construction of Modal Logics
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavi...
Corina Cîrstea, Dirk Pattinson
CONCUR
2004
Springer
13 years 9 months ago
Type Based Discretionary Access Control
Abstract. Discretionary Access Control (DAC) systems provide powerful mechanisms for resource management based on the selective distribution of capabilities to selected classes of ...
Michele Bugliesi, Dario Colazzo, Silvia Crafa
CONCUR
2004
Springer
13 years 9 months ago
µABC: A Minimal Aspect Calculus
Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James...
CONCUR
2004
Springer
13 years 9 months ago
A Semantics for Concurrent Separation Logic
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
Stephen D. Brookes
CONCUR
2004
Springer
13 years 9 months ago
Message-Passing Automata Are Expressively Equivalent to EMSO Logic
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...
Benedikt Bollig, Martin Leucker