A Symbolic model for timed concurrent constraint programming
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFRN |
Texto Completo: | https://repositorio.ufrn.br/jspui/handle/123456789/29761 |
Resumo: | Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification of reactive systems. Moreover, ntcc features constructors for non-deterministic choices and asynchronous behavior, thus allowing for (1) synchronization of processes via constraint entailment during a time-unit and (2) synchronization of processes along time-intervals. In this paper we develop the techniques needed for the automatic verification of ntcc programs based on symbolic model checking. We show that the internal transition relation, modeling the behavior of processes during a time-unit (1 above), can be symbolically represented by formulas in a suitable fragment of linear time temporal logic. Moreover, by using standard techniques as difference decision diagrams, we provide a compact representation of these constraints. Then, relying on a fixpoint characterization of the timed constructs, we obtain a symbolic model of the observable transition (2 above). We prove that our construction is correct with respect to the operational semantics. Finally, we introduce a prototypical tool implementing our method |
id |
UFRN_002293a67327f2f62ac942a9e956c6c3 |
---|---|
oai_identifier_str |
oai:https://repositorio.ufrn.br:123456789/29761 |
network_acronym_str |
UFRN |
network_name_str |
Repositório Institucional da UFRN |
repository_id_str |
|
spelling |
Arias, JaimeGuzman, MichellVega, Carlos Alberto Olarte2020-07-30T19:15:42Z2020-07-30T19:15:42Z2015ARIAS, Jaime; GUZMÁN, Michell; OLARTE, Carlos. A Symbolic Model for Timed Concurrent Constraint Programming. Electronic Notes In Theoretical Computer Science, [S.L.], v. 312, p. 161-177, abr. 2015. Disponível em: https://www.sciencedirect.com/science/article/pii/S1571066115000146?via%3Dihub. Acesso em: 29 jul. 2020. http://dx.doi.org/10.1016/j.entcs.2015.04.0101571-0661https://repositorio.ufrn.br/jspui/handle/123456789/2976110.1016/j.entcs.2015.04.010ElsevierConcurrent constraint programmingTemporal logicModel checkingA Symbolic model for timed concurrent constraint programminginfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleConcurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification of reactive systems. Moreover, ntcc features constructors for non-deterministic choices and asynchronous behavior, thus allowing for (1) synchronization of processes via constraint entailment during a time-unit and (2) synchronization of processes along time-intervals. In this paper we develop the techniques needed for the automatic verification of ntcc programs based on symbolic model checking. We show that the internal transition relation, modeling the behavior of processes during a time-unit (1 above), can be symbolically represented by formulas in a suitable fragment of linear time temporal logic. Moreover, by using standard techniques as difference decision diagrams, we provide a compact representation of these constraints. Then, relying on a fixpoint characterization of the timed constructs, we obtain a symbolic model of the observable transition (2 above). We prove that our construction is correct with respect to the operational semantics. Finally, we introduce a prototypical tool implementing our methodengreponame:Repositório Institucional da UFRNinstname:Universidade Federal do Rio Grande do Norte (UFRN)instacron:UFRNinfo:eu-repo/semantics/openAccessORIGINALSymbolicModelTimedConcurrent_VEGA_2015.pdfSymbolicModelTimedConcurrent_VEGA_2015.pdfapplication/pdf338119https://repositorio.ufrn.br/bitstream/123456789/29761/1/SymbolicModelTimedConcurrent_VEGA_2015.pdf3624376aa3f0e01d0d1002835cd9aca4MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81484https://repositorio.ufrn.br/bitstream/123456789/29761/2/license.txte9597aa2854d128fd968be5edc8a28d9MD52TEXTSymbolicModelTimedConcurrent_VEGA_2015.pdf.txtSymbolicModelTimedConcurrent_VEGA_2015.pdf.txtExtracted texttext/plain49609https://repositorio.ufrn.br/bitstream/123456789/29761/3/SymbolicModelTimedConcurrent_VEGA_2015.pdf.txt952ad112da546e96159e9d94ff45f9b8MD53THUMBNAILSymbolicModelTimedConcurrent_VEGA_2015.pdf.jpgSymbolicModelTimedConcurrent_VEGA_2015.pdf.jpgGenerated Thumbnailimage/jpeg1472https://repositorio.ufrn.br/bitstream/123456789/29761/4/SymbolicModelTimedConcurrent_VEGA_2015.pdf.jpgf2a06755a27f650584d82f2f268e8addMD54123456789/297612020-08-02 04:54:43.995oai:https://repositorio.ufrn.br:123456789/29761Tk9OLUVYQ0xVU0lWRSBESVNUUklCVVRJT04gTElDRU5TRQoKCkJ5IHNpZ25pbmcgYW5kIGRlbGl2ZXJpbmcgdGhpcyBsaWNlbnNlLCBNci4gKGF1dGhvciBvciBjb3B5cmlnaHQgaG9sZGVyKToKCgphKSBHcmFudHMgdGhlIFVuaXZlcnNpZGFkZSBGZWRlcmFsIFJpbyBHcmFuZGUgZG8gTm9ydGUgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgb2YKcmVwcm9kdWNlLCBjb252ZXJ0IChhcyBkZWZpbmVkIGJlbG93KSwgY29tbXVuaWNhdGUgYW5kIC8gb3IKZGlzdHJpYnV0ZSB0aGUgZGVsaXZlcmVkIGRvY3VtZW50IChpbmNsdWRpbmcgYWJzdHJhY3QgLyBhYnN0cmFjdCkgaW4KZGlnaXRhbCBvciBwcmludGVkIGZvcm1hdCBhbmQgaW4gYW55IG1lZGl1bS4KCmIpIERlY2xhcmVzIHRoYXQgdGhlIGRvY3VtZW50IHN1Ym1pdHRlZCBpcyBpdHMgb3JpZ2luYWwgd29yaywgYW5kIHRoYXQKeW91IGhhdmUgdGhlIHJpZ2h0IHRvIGdyYW50IHRoZSByaWdodHMgY29udGFpbmVkIGluIHRoaXMgbGljZW5zZS4gRGVjbGFyZXMKdGhhdCB0aGUgZGVsaXZlcnkgb2YgdGhlIGRvY3VtZW50IGRvZXMgbm90IGluZnJpbmdlLCBhcyBmYXIgYXMgaXQgaXMKdGhlIHJpZ2h0cyBvZiBhbnkgb3RoZXIgcGVyc29uIG9yIGVudGl0eS4KCmMpIElmIHRoZSBkb2N1bWVudCBkZWxpdmVyZWQgY29udGFpbnMgbWF0ZXJpYWwgd2hpY2ggZG9lcyBub3QKcmlnaHRzLCBkZWNsYXJlcyB0aGF0IGl0IGhhcyBvYnRhaW5lZCBhdXRob3JpemF0aW9uIGZyb20gdGhlIGhvbGRlciBvZiB0aGUKY29weXJpZ2h0IHRvIGdyYW50IHRoZSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gR3JhbmRlIGRvIE5vcnRlIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdCB0aGlzIG1hdGVyaWFsIHdob3NlIHJpZ2h0cyBhcmUgb2YKdGhpcmQgcGFydGllcyBpcyBjbGVhcmx5IGlkZW50aWZpZWQgYW5kIHJlY29nbml6ZWQgaW4gdGhlIHRleHQgb3IKY29udGVudCBvZiB0aGUgZG9jdW1lbnQgZGVsaXZlcmVkLgoKSWYgdGhlIGRvY3VtZW50IHN1Ym1pdHRlZCBpcyBiYXNlZCBvbiBmdW5kZWQgb3Igc3VwcG9ydGVkIHdvcmsKYnkgYW5vdGhlciBpbnN0aXR1dGlvbiBvdGhlciB0aGFuIHRoZSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gR3JhbmRlIGRvIE5vcnRlLCBkZWNsYXJlcyB0aGF0IGl0IGhhcyBmdWxmaWxsZWQgYW55IG9ibGlnYXRpb25zIHJlcXVpcmVkIGJ5IHRoZSByZXNwZWN0aXZlIGFncmVlbWVudCBvciBhZ3JlZW1lbnQuCgpUaGUgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZG8gUmlvIEdyYW5kZSBkbyBOb3J0ZSB3aWxsIGNsZWFybHkgaWRlbnRpZnkgaXRzIG5hbWUgKHMpIGFzIHRoZSBhdXRob3IgKHMpIG9yIGhvbGRlciAocykgb2YgdGhlIGRvY3VtZW50J3MgcmlnaHRzCmRlbGl2ZXJlZCwgYW5kIHdpbGwgbm90IG1ha2UgYW55IGNoYW5nZXMsIG90aGVyIHRoYW4gdGhvc2UgcGVybWl0dGVkIGJ5CnRoaXMgbGljZW5zZQo=Repositório de PublicaçõesPUBhttp://repositorio.ufrn.br/oai/opendoar:2020-08-02T07:54:43Repositório Institucional da UFRN - Universidade Federal do Rio Grande do Norte (UFRN)false |
dc.title.pt_BR.fl_str_mv |
A Symbolic model for timed concurrent constraint programming |
title |
A Symbolic model for timed concurrent constraint programming |
spellingShingle |
A Symbolic model for timed concurrent constraint programming Arias, Jaime Concurrent constraint programming Temporal logic Model checking |
title_short |
A Symbolic model for timed concurrent constraint programming |
title_full |
A Symbolic model for timed concurrent constraint programming |
title_fullStr |
A Symbolic model for timed concurrent constraint programming |
title_full_unstemmed |
A Symbolic model for timed concurrent constraint programming |
title_sort |
A Symbolic model for timed concurrent constraint programming |
author |
Arias, Jaime |
author_facet |
Arias, Jaime Guzman, Michell Vega, Carlos Alberto Olarte |
author_role |
author |
author2 |
Guzman, Michell Vega, Carlos Alberto Olarte |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Arias, Jaime Guzman, Michell Vega, Carlos Alberto Olarte |
dc.subject.por.fl_str_mv |
Concurrent constraint programming Temporal logic Model checking |
topic |
Concurrent constraint programming Temporal logic Model checking |
description |
Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification of reactive systems. Moreover, ntcc features constructors for non-deterministic choices and asynchronous behavior, thus allowing for (1) synchronization of processes via constraint entailment during a time-unit and (2) synchronization of processes along time-intervals. In this paper we develop the techniques needed for the automatic verification of ntcc programs based on symbolic model checking. We show that the internal transition relation, modeling the behavior of processes during a time-unit (1 above), can be symbolically represented by formulas in a suitable fragment of linear time temporal logic. Moreover, by using standard techniques as difference decision diagrams, we provide a compact representation of these constraints. Then, relying on a fixpoint characterization of the timed constructs, we obtain a symbolic model of the observable transition (2 above). We prove that our construction is correct with respect to the operational semantics. Finally, we introduce a prototypical tool implementing our method |
publishDate |
2015 |
dc.date.issued.fl_str_mv |
2015 |
dc.date.accessioned.fl_str_mv |
2020-07-30T19:15:42Z |
dc.date.available.fl_str_mv |
2020-07-30T19:15:42Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
ARIAS, Jaime; GUZMÁN, Michell; OLARTE, Carlos. A Symbolic Model for Timed Concurrent Constraint Programming. Electronic Notes In Theoretical Computer Science, [S.L.], v. 312, p. 161-177, abr. 2015. Disponível em: https://www.sciencedirect.com/science/article/pii/S1571066115000146?via%3Dihub. Acesso em: 29 jul. 2020. http://dx.doi.org/10.1016/j.entcs.2015.04.010 |
dc.identifier.uri.fl_str_mv |
https://repositorio.ufrn.br/jspui/handle/123456789/29761 |
dc.identifier.issn.none.fl_str_mv |
1571-0661 |
dc.identifier.doi.none.fl_str_mv |
10.1016/j.entcs.2015.04.010 |
identifier_str_mv |
ARIAS, Jaime; GUZMÁN, Michell; OLARTE, Carlos. A Symbolic Model for Timed Concurrent Constraint Programming. Electronic Notes In Theoretical Computer Science, [S.L.], v. 312, p. 161-177, abr. 2015. Disponível em: https://www.sciencedirect.com/science/article/pii/S1571066115000146?via%3Dihub. Acesso em: 29 jul. 2020. http://dx.doi.org/10.1016/j.entcs.2015.04.010 1571-0661 10.1016/j.entcs.2015.04.010 |
url |
https://repositorio.ufrn.br/jspui/handle/123456789/29761 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFRN instname:Universidade Federal do Rio Grande do Norte (UFRN) instacron:UFRN |
instname_str |
Universidade Federal do Rio Grande do Norte (UFRN) |
instacron_str |
UFRN |
institution |
UFRN |
reponame_str |
Repositório Institucional da UFRN |
collection |
Repositório Institucional da UFRN |
bitstream.url.fl_str_mv |
https://repositorio.ufrn.br/bitstream/123456789/29761/1/SymbolicModelTimedConcurrent_VEGA_2015.pdf https://repositorio.ufrn.br/bitstream/123456789/29761/2/license.txt https://repositorio.ufrn.br/bitstream/123456789/29761/3/SymbolicModelTimedConcurrent_VEGA_2015.pdf.txt https://repositorio.ufrn.br/bitstream/123456789/29761/4/SymbolicModelTimedConcurrent_VEGA_2015.pdf.jpg |
bitstream.checksum.fl_str_mv |
3624376aa3f0e01d0d1002835cd9aca4 e9597aa2854d128fd968be5edc8a28d9 952ad112da546e96159e9d94ff45f9b8 f2a06755a27f650584d82f2f268e8add |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFRN - Universidade Federal do Rio Grande do Norte (UFRN) |
repository.mail.fl_str_mv |
|
_version_ |
1814833005247594496 |