Sciweavers

314 search results - page 25 / 63
» A Calculus and logic of resources and processes
Sort
View
ICALP
1998
Springer
15 years 2 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
STACS
2010
Springer
15 years 4 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
TGC
2007
Springer
15 years 3 months ago
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computation...
Luigi Liquori, Michel Cosnard
I3E
2004
145views Business» more  I3E 2004»
14 years 11 months ago
Evolution of Service Processes by Rule Based Transformation
: The notion of service is closely coupled with the notion of process in general and of workflow in particular. Processes capture the coordination logic for the various resources i...
Christian Zirpins, Giacomo Piccinelli
AIA
2006
14 years 11 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann