Automated deduction of finite-state control programs for reactive systems

Simple item page
dc.contributor.authorMalik, Robi
dc.coverage.spatialConference held at Lindau, Germanyen_NZ
dc.date.accessioned2008-12-17T01:09:08Z
dc.date.available2008-12-17T01:09:08Z
dc.date.issued1998
dc.description.abstractWe propose an approach towards the automatic synthesis of finite-state reactive control programs from purely declarative, logic specifications of their requirements. More precisely, if P is a set of propositional temporal logic formulas, representing the environment of a reactive system, and if a is a propositional formula, representing a safety requirement, then we point out how to deduce a most general set C of formulas, representing a control program, such that P ∪ C ≒ α.en_US
dc.identifier.citationMalik, R. (1998). Automated deduction of finite-state control programs for reactive systems. In Proceedings of 15th International Conference on Automated Deduction Lindau, Germany, July 5–10, 1998(pp. 302- 316). Berlin: Springer.en_US
dc.identifier.doi10.1007/BFb0054268en_US
dc.identifier.urihttps://hdl.handle.net/10289/1702
dc.language.isoen
dc.publisherSpringer, Berlinen_US
dc.relation.isPartOfProc 15th International Conference on Automated Deductionen_NZ
dc.relation.urihttp://www.springerlink.com/content/q3nk522235207822/en_US
dc.sourceCADE-15en_NZ
dc.subjectcomputer scienceen_US
dc.subjectfinite-state control programen_US
dc.titleAutomated deduction of finite-state control programs for reactive systemsen_US
dc.typeConference Contributionen_US
pubs.begin-page302en_NZ
pubs.elements-id18452
pubs.end-page309en_NZ
pubs.finish-date1998-07-10en_NZ
pubs.start-date1998-07-05en_NZ
pubs.volumeLNCS 1421en_NZ
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description:
Name: license.txt
Size: 1.79 KB
Kind: License
Collections
Computing and Mathematical Sciences Papers