Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Well Structured Transition Systems with History
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
Univ Genoa, Genoa, Italy..
Free Univ Bolzano, Bolzano, Italy..
2015 (Engelska)Ingår i: Electronic Proceedings in Theoretical Computer Science, ISSN 2075-2180, E-ISSN 2075-2180, nr 193, 115-128 s.Artikel i tidskrift (Refereegranskat) Published
Resurstyp
Text
Abstract [en]

We propose a formal model of concurrent systems in which the history of a computation is explicitly represented as a collection of events that provide a view of a sequence of configurations. In our model events generated by transitions become part of the system configurations leading to operational semantics with historical data. This model allows us to formalize what is usually done in symbolic verification algorithms. Indeed, search algorithms often use meta-information, e.g., names of fired transitions, selected processes, etc., to reconstruct (error) traces from symbolic state exploration. The other interesting point of the proposed model is related to a possible new application of the theory of well-structured transition systems (wsts). In our setting wsts theory can be applied to formally extend the class of properties that can be verified using coverability to take into consideration (ordered and unordered) historical data. This can be done by using different types of representation of collections of events and by combining them with wsts by using closure properties of well-quasi orderings.

Ort, förlag, år, upplaga, sidor
2015. nr 193, 115-128 s.
Nationell ämneskategori
Datorteknik
Identifikatorer
URN: urn:nbn:se:uu:diva-275495DOI: 10.4204/EPTCS.193.9ISI: 000367344400009OAI: oai:DiVA.org:uu-275495DiVA: diva2:900375
Tillgänglig från: 2016-02-04 Skapad: 2016-02-04 Senast uppdaterad: 2016-02-04Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas

Övriga länkar

Förlagets fulltext

Sök vidare i DiVA

Av författaren/redaktören
Abdulla, Parosh A.
Av organisationen
Datorteknik
I samma tidskrift
Electronic Proceedings in Theoretical Computer Science
Datorteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar

Altmetricpoäng

Totalt: 401 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf