Sciweavers

57 search results - page 4 / 12
» Initial Algebra Semantics Is Enough!
Sort
View
LICS
1999
IEEE
13 years 12 months ago
Abstract Syntax and Variable Binding
Syntax and Variable Binding d Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi LFCS Univ. of Edinburgh op a theory of abstract synt...
Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi
ADC
2003
Springer
135views Database» more  ADC 2003»
14 years 27 days ago
A Petri Net-based Model for Web Service Composition
The Internet is going through several major changes. It has become a vehicle of Web services rather than just a repository of information. Many organizations are putting their cor...
Rachid Hamadi, Boualem Benatallah
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
13 years 11 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
SEFM
2006
IEEE
14 years 1 months ago
Product Automata and Process Algebra
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
Kamal Lodaya
ENTCS
2006
124views more  ENTCS 2006»
13 years 7 months ago
Generic Trace Theory
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...
Ichiro Hasuo, Bart Jacobs, Ana Sokolova