uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The meaning of negative premises in transition system specifications
Uppsala University.
Uppsala University.
1996 (English)In: JOURNAL OF THE ACM, ISSN 0004-5411, Vol. 43, no 5, 863-914 p.Article in journal (Other scientific) Published
Abstract [en]

We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in order to be meaningful, that is, to unequivocally define a transition relat

Place, publisher, year, edition, pages
ASSOC COMPUTING MACHINERY , 1996. Vol. 43, no 5, 863-914 p.
Keyword [en]
bisimulation; congruence; conservative extension of TSSs; logic programming; negative premises; ntyft/ntyxt-format; priorities and abstraction; process algebra; OPERATIONAL SEMANTICS; BISIMULATION
Identifiers
URN: urn:nbn:se:uu:diva-27227OAI: oai:DiVA.org:uu-27227DiVA: diva2:55121
Note
Addresses: Bol R, UNIV UPPSALA, DEPT COMP SYST, POB 325, S-75105 UPPSALA, SWEDEN. CTR MATH & COMP SCI, NL-1000 AB AMSTERDAM, NETHERLANDS.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-15

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 342 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf