Sciweavers

950 search results - page 105 / 190
» Process Algebra in PVS
Sort
View
FAC
2007
122views more  FAC 2007»
15 years 6 months ago
Formal techniques for performance analysis: blending SAN and PEPA
Abstract. In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, an...
Jane Hillston, Leïla Kloul
LPNMR
1990
Springer
15 years 10 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
VLDB
2002
ACM
139views Database» more  VLDB 2002»
16 years 6 months ago
TIMBER: A native XML database
Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based u...
H. V. Jagadish, Shurug Al-Khalifa, Adriane Chapman...
JLP
2007
91views more  JLP 2007»
15 years 6 months ago
Non-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is th...
Marco Bernardo
ENTCS
2000
97views more  ENTCS 2000»
15 years 6 months ago
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
Jirí Srba