Sciweavers

4385 search results - page 413 / 877
» Abstraction for Concurrent Objects
Sort
View
JLP
2007
99views more  JLP 2007»
15 years 6 months ago
Resources in process algebra
The algebra of communicating shared resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Anna Philippou, Oleg Sokolsky
FMSD
2002
81views more  FMSD 2002»
15 years 6 months ago
A Notation and Logic for Mobile Computing
Abstract. We de ne a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pat...
Gruia-Catalin Roman, Peter J. McCann
TSE
1998
77views more  TSE 1998»
15 years 6 months ago
Use Case Maps as Architectural Entities for Complex Systems
ABSTRACT. This paper presents a novel, scenario-based notation called Use Case Maps (UCMs) for describing, in a high-level way, how the organizational structure of a complex system...
Raymond J. A. Buhr
IANDC
2010
116views more  IANDC 2010»
15 years 5 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
IANDC
2010
68views more  IANDC 2010»
15 years 5 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr