Sciweavers

1992 search results - page 9 / 399
» Model Based Testing with Labelled Transition Systems
Sort
View
WWW
2003
ACM
14 years 8 months ago
On labeling schemes for the semantic web
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
Vassilis Christophides, Dimitris Plexousakis, Mich...
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
ACSD
2003
IEEE
151views Hardware» more  ACSD 2003»
14 years 20 days ago
Communicating Transaction Processes
Message Sequence Charts (MSC) have been traditionally used to depict execution scenarios in the early stages of design cycle. MSCs portray inter-process ( inter-object) interactio...
Abhik Roychoudhury, P. S. Thiagarajan
CONCUR
1998
Springer
13 years 11 months ago
Alternating Refinement Relations
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system compo...
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, ...
CSL
2007
Springer
13 years 11 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...