No Cover Image

Book chapter 1223 views

A Specification Theory of Real-Time Processes

Chris Chilton, Marta Kwiatkowska, Faron Moller Orcid Logo, Xu Wang

Concurrency, Security, and Puzzles, Volume: 10160, Pages: 18 - 38

Swansea University Author: Faron Moller Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1007/978-3-319-51046-0_2

Abstract

This paper presents an assume-guarantee specification theory for modular synthesis and verification of real-time processes with critical timing constraints. Four operations - conjunction, disjunction, parallel and quotient - are defined over specifications, drawing inspirations from classic specific...

Full description

Published in: Concurrency, Security, and Puzzles
ISBN: 9783319510453 9783319510460
ISSN: 0302-9743 1611-3349
Published: Cham Springer International Publishing 2016
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa33932
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2017-05-25T14:07:45Z
last_indexed 2022-06-17T02:48:21Z
id cronfa33932
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2022-06-16T15:06:11.0252211</datestamp><bib-version>v2</bib-version><id>33932</id><entry>2017-05-25</entry><title>A Specification Theory of Real-Time Processes</title><swanseaauthors><author><sid>bf25e0b52fe7c11c473cc48d306073f7</sid><ORCID>0000-0001-9535-8053</ORCID><firstname>Faron</firstname><surname>Moller</surname><name>Faron Moller</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2017-05-25</date><deptcode>SCS</deptcode><abstract>This paper presents an assume-guarantee specification theory for modular synthesis and verification of real-time processes with critical timing constraints. Four operations - conjunction, disjunction, parallel and quotient - are defined over specifications, drawing inspirations from classic specification theories like refinement calculus. We show that a (pre-)congruence characterised by a trace-based semantics&#xA0;captures exactly the notion of substitutivity andrefinement between specifications.</abstract><type>Book chapter</type><journal>Concurrency, Security, and Puzzles</journal><volume>10160</volume><journalNumber/><paginationStart>18</paginationStart><paginationEnd>38</paginationEnd><publisher>Springer International Publishing</publisher><placeOfPublication>Cham</placeOfPublication><isbnPrint>9783319510453</isbnPrint><isbnElectronic>9783319510460</isbnElectronic><issnPrint>0302-9743</issnPrint><issnElectronic>1611-3349</issnElectronic><keywords>concurrency, specification, refinement</keywords><publishedDay>18</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2016</publishedYear><publishedDate>2016-12-18</publishedDate><doi>10.1007/978-3-319-51046-0_2</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2022-06-16T15:06:11.0252211</lastEdited><Created>2017-05-25T09:06:19.9884437</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Chris</firstname><surname>Chilton</surname><order>1</order></author><author><firstname>Marta</firstname><surname>Kwiatkowska</surname><order>2</order></author><author><firstname>Faron</firstname><surname>Moller</surname><orcid>0000-0001-9535-8053</orcid><order>3</order></author><author><firstname>Xu</firstname><surname>Wang</surname><order>4</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2022-06-16T15:06:11.0252211 v2 33932 2017-05-25 A Specification Theory of Real-Time Processes bf25e0b52fe7c11c473cc48d306073f7 0000-0001-9535-8053 Faron Moller Faron Moller true false 2017-05-25 SCS This paper presents an assume-guarantee specification theory for modular synthesis and verification of real-time processes with critical timing constraints. Four operations - conjunction, disjunction, parallel and quotient - are defined over specifications, drawing inspirations from classic specification theories like refinement calculus. We show that a (pre-)congruence characterised by a trace-based semantics captures exactly the notion of substitutivity andrefinement between specifications. Book chapter Concurrency, Security, and Puzzles 10160 18 38 Springer International Publishing Cham 9783319510453 9783319510460 0302-9743 1611-3349 concurrency, specification, refinement 18 12 2016 2016-12-18 10.1007/978-3-319-51046-0_2 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2022-06-16T15:06:11.0252211 2017-05-25T09:06:19.9884437 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Chris Chilton 1 Marta Kwiatkowska 2 Faron Moller 0000-0001-9535-8053 3 Xu Wang 4
title A Specification Theory of Real-Time Processes
spellingShingle A Specification Theory of Real-Time Processes
Faron Moller
title_short A Specification Theory of Real-Time Processes
title_full A Specification Theory of Real-Time Processes
title_fullStr A Specification Theory of Real-Time Processes
title_full_unstemmed A Specification Theory of Real-Time Processes
title_sort A Specification Theory of Real-Time Processes
author_id_str_mv bf25e0b52fe7c11c473cc48d306073f7
author_id_fullname_str_mv bf25e0b52fe7c11c473cc48d306073f7_***_Faron Moller
author Faron Moller
author2 Chris Chilton
Marta Kwiatkowska
Faron Moller
Xu Wang
format Book chapter
container_title Concurrency, Security, and Puzzles
container_volume 10160
container_start_page 18
publishDate 2016
institution Swansea University
isbn 9783319510453
9783319510460
issn 0302-9743
1611-3349
doi_str_mv 10.1007/978-3-319-51046-0_2
publisher Springer International Publishing
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description This paper presents an assume-guarantee specification theory for modular synthesis and verification of real-time processes with critical timing constraints. Four operations - conjunction, disjunction, parallel and quotient - are defined over specifications, drawing inspirations from classic specification theories like refinement calculus. We show that a (pre-)congruence characterised by a trace-based semantics captures exactly the notion of substitutivity andrefinement between specifications.
published_date 2016-12-18T03:42:05Z
_version_ 1763751939406823424
score 11.021648

Similar Items