This HTML5 document contains 30 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n2https://kar.kent.ac.uk/id/eprint/
wdrshttp://www.w3.org/2007/05/powder-s#
dchttp://purl.org/dc/elements/1.1/
n5http://purl.org/ontology/bibo/status/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n16https://kar.kent.ac.uk/id/subject/
n11https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n8http://eprints.org/ontology/
n20https://kar.kent.ac.uk/id/event/
n15doi:10.4230/
bibohttp://purl.org/ontology/bibo/
n22https://kar.kent.ac.uk/id/publication/
n21https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n4https://kar.kent.ac.uk/id/eprint/67556#
n7https://kar.kent.ac.uk/id/
n9https://kar.kent.ac.uk/id/document/
n19https://kar.kent.ac.uk/67556/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n12https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:67556
rdf:type
bibo:AcademicArticle n8:ConferenceItemEPrint n8:EPrint bibo:Article
rdfs:seeAlso
n19:
owl:sameAs
n15:LIPIcs.CONCUR.2018.40
n8:hasDocument
n9:2480261 n9:1999800 n9:2559281 n9:2559282 n9:2559283 n9:2559284
n8:hasPublished
n9:1999800
dc:hasVersion
n9:1999800
dcterms:title
Progress-preserving Refinements of CTA
wdrs:describedby
n11:export_kar_RDFN3.n3 n17:export_kar_RDFN3.n3
dcterms:date
2018-09-07
dcterms:creator
n12:ext-l.bocchi@kent.ac.uk n12:ext-d33af07c3883eaff6a4fad33e8422e23 n12:ext-aa0cc2782b79db0bf6bd5cf50c0e9ce4
bibo:status
n5:peerReviewed n5:published
dcterms:publisher
n21:ext-fb716d0e4677e460329957b7f78b51e8
bibo:abstract
We develop a theory of refinement for timed asynchronous systems, in the setting of Communicating Timed Automata (CTA). Our refinement applies point-wise to the components of a system of CTA, and only affecting their time constraints—in this way, we achieve compositionality and decidability. We then establish a decidable condition under which our refinement preserves behavioural properties of systems,such as their global and local progress. Our theory provides guidelines on how to implement timed protocols using the real-time primitives of programming languages. We validate our theory through a series of experiments, supported by an open-source tool which implements our verification techniques.
dcterms:isPartOf
n7:repository n22:ext-18688969
dcterms:subject
n16:QA76
bibo:authorList
n4:authors
bibo:presentedAt
n20:ext-fa09daa7ede269d98d8775ffe55e8a4a