Sciweavers

CONCUR
2004
Springer
14 years 4 months ago
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
Antonín Kucera, Ph. Schnoebelen
CONCUR
2004
Springer
14 years 4 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
CONCUR
2004
Springer
14 years 4 months ago
Timed vs. Time-Triggered Automata
Pavel Krcál, Leonid Mokrushin, P. S. Thiaga...
CONCUR
2004
Springer
14 years 5 months ago
Session Types for Functional Multithreading
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
Vasco Thudichum Vasconcelos, António Ravara...
CONCUR
2004
Springer
14 years 5 months ago
Probabilistic Event Structures and Domains
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
Daniele Varacca, Hagen Völzer, Glynn Winskel
CONCUR
2004
Springer
14 years 5 months ago
Open Maps, Alternating Simulations and Control Synthesis
Abstract. Control synthesis is slowly transcending its traditional application domain within engineering to find interesting and useful applications in computer science. Synthesis...
Paulo Tabuada
CONCUR
2004
Springer
14 years 5 months ago
Resources, Concurrency and Local Reasoning
In this paper we show how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.
Peter W. O'Hearn
CONCUR
2004
Springer
14 years 5 months ago
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Nicolas Markey, Jean-François Raskin