About: Progress-preserving Refinements of CTA

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Progress-preserving Refinements of CTA Goto Sponge NotDistinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ConferenceItemEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #67556 Progress-preserving Refinements of CTA
sameAs	Progress-preserving Refinements of CTA
http://eprints.org/ontology/hasDocument	Progress-preserving Refinements of CTA (PDF) Progress-preserving Refinements of CTA (Other) Progress-preserving Refinements of CTA (Other) Progress-preserving Refinements of CTA (Other) Progress-preserving Refinements of CTA (Other) Progress-preserving Refinements of CTA (Other)
http://eprints.org/ontology/hasPublished	Progress-preserving Refinements of CTA (PDF)
dc:hasVersion	Progress-preserving Refinements of CTA (PDF)
Title	Progress-preserving Refinements of CTA
described by	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3 https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
Date	2018-09-07
Creator	Massimo Bartoletti Massimo Murgia Laura Bocchi
status	peer reviewed published
Publisher	Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
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.
Is Part Of	Leibniz International Proceedings in Informatics https://kar.kent.ac.uk/id/repository
Subject	QA 76 Software, computer programming,
list of authors	https://kar.kent.ac.uk/id/eprint/67556#authors
presented at	29th International Conference on Concurrency Theory (CONCUR 2018), 4--7 September 2018, Beijing, China
is topic of	https://www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3 https://raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #67556 Progress-preserving Refinements of CTA

Faceted Search & Find service v1.17_git144 as of Jul 26 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Aug 25 2024, on Linux (x86_64-ubuntu_noble-linux-glibc2.38-64), Single-Server Edition (378 GB total memory, 15 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software