Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Reactive C: an extension of C to program reactive systems
Software—Practice & Experience
Requirements Specification for Process-Control Systems
IEEE Transactions on Software Engineering
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Modechart: A Specification Language for Real-Time Systems
IEEE Transactions on Software Engineering
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
The principles of mathematics revisited
The principles of mathematics revisited
The sugarCubes tool box: a reactive Java framework
Software—Practice & Experience
Proof, language, and interaction
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Modal and temporal properties of processes
Modal and temporal properties of processes
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
The intuitionism behind Statecharts steps
ACM Transactions on Computational Logic (TOCL)
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
IEEE Transactions on Software Engineering
What is in a Step: On the Semantics of Statecharts
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Statecharts Via Process Algebra
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
A Comparison of Statecharts Variants
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Modeling Statecharts Behaviour in a Fully Abstract Way
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
Constructive Analysis of Cyclic Circuits
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Believe it or not, AJM's games model is a model of classical linear logic
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
ReactiveML: a reactive extension to ML
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Compiling Esterel
Hazard detection in combinational and sequential switching circuits
IBM Journal of Research and Development
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
This paper presents some results towards a game-theoretic account of the constructive semantics of step responses for synchronous languages, providing a coherent semantic framework encompassing both non-deterministic Statecharts (as per Pnueli & Shalev) and deterministic esterel. In particular, it is shown that esterel arises from a finiteness condition on strategies whereas Statecharts permits infinite games. Beyond giving a novel and unifying account of these concrete languages the paper sketches a general theory for obtaining different notions of constructive responses in terms of winning conditions for finite and infinite games and their characterisation as maximal post-fixed points of functions in directed complete lattices of intensional truth-values.