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
Partial order reductions for timed systems
Uppsala University.
Uppsala University.
Uppsala University.
Uppsala University.
1998 (English)In: CONCUR'98: CONCURRENCY THEORY, ISSN 0302-9743, Vol. 1466, 485-500 p.Article in journal (Other scientific) Published
Abstract [en]

In this paper, we present a partial-order reduction method for timed systems based on a local-time semantics for networks of timed automata. The main idea is to remove the implicit clock synchronization between processes in a network by letting local cloc

Place, publisher, year, edition, pages
SPRINGER-VERLAG BERLIN , 1998. Vol. 1466, 485-500 p.
Keyword [en]
VERIFICATION
Identifiers
URN: urn:nbn:se:uu:diva-27329OAI: oai:DiVA.org:uu-27329DiVA: diva2:55224
Note
Addresses: Bengtsson J, Uppsala Univ, Dept Comp Syst, Uppsala, Sweden. Uppsala Univ, Dept Comp Syst, Uppsala, Sweden. Abo Akad Univ, TUCS, Dept Comp Sci, Turku, Finland.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 390 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