Sciweavers

656 search results - page 8 / 132
» A Formalization of Transition P Systems
Sort
View
76
Voted
ISOLA
2010
Springer
14 years 7 months ago
Analysing Message Sequence Graph Specifications
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has...
Joy Chakraborty, Deepak D'Souza, K. Narayan Kumar
51
Voted
FLAIRS
2000
14 years 10 months ago
Formal Concepts of Learning Systems Validation in Use
Volker Dötsch, Gunter Grieser, Klaus P. Jantk...
SAC
2003
ACM
15 years 2 months ago
Semantic Matchmaking in a P-2-P Electronic Marketplace
Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are ...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
IANDC
1998
106views more  IANDC 1998»
14 years 9 months ago
A Conservative Look at Operational Semantics with Variable Binding
We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechan...
Wan Fokkink, Chris Verhoef
65
Voted
TCS
2008
14 years 9 months ago
Compositional semantics and behavioral equivalences for P Systems
The aim of the paper is to give a compositional semantics in the style of the Structural Operational Semantics (SOS) and to study behavioral equivalence notions for P Systems. Fir...
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...