maude-help AT lists.siebelschool.illinois.edu
Subject: Maude-help mailing list
List archive
- From: "Veselinov, Roman" <roma AT WPI.EDU>
- To: "maude-help AT maude.cs.uiuc.edu" <maude-help AT peepal.cs.uiuc.edu>
- Subject: [Maude-help] synchronous product
- Date: Thu, 27 Sep 2007 11:37:51 -0400
- Accept-language: en-US
- Acceptlanguage: en-US
- List-archive: <http://maude.cs.uiuc.edu/pipermail/maude-help>
- List-id: Maude help list <maude-help.maude.cs.uiuc.edu>
Hello,
My name is Roman and I am just starting to understand Maude with its syntax and semantics. I have couple of question (forgive me for not being specific enough) and I will be grateful if someone can guide me towards an answer:
The part I am trying to work out is that from each node there are transitions to more than one node – I have to explicitly write this using rules for each edge. Is there a way to have Maude choose from a pool of values for my variable instead of me explicitly doing that as in this ex:
var A can be either 1,2 or 3.
rl [1] : node(1) => node(2) rl [2] : node(1) => node(3) rl [3] : node(2) => node(1) rl [4] : node(2) => node(3) …. This is much more simple example and if there are more values for A and nodes the number of rl to be written grows exponentially. I understand node(1) => node(A) is illegal since the variable must be bounded so I am hoping for guidance on this.
Thank you in advance for your help.
Regards,
Roman
|
- [Maude-help] synchronous product, Veselinov, Roman, 09/27/2007
- Re: [Maude-help] synchronous product, Steven Eker, 09/27/2007
Archive powered by MHonArc 2.6.16.