656 search results - page 8 / 132 » A Formalization of Transition P Systems |
102
Voted
ISOLA
2010
Springer
14 years 10 months ago
2010
Springer
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...
FLAIRS
2000
15 years 2 months ago
2000
104
Voted
SAC
2003
ACM
15 years 6 months ago
2003
ACM
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 ...
104
click to vote
IANDC
1998
15 years 11 days ago
1998
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...
TCS
2008
15 years 18 days ago
2008
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...