Constructive semantics for instantaneous reactions
From MaRDI portal
Publication:631753
DOI10.1016/j.tcs.2010.09.007zbMath1207.68202OpenAlexW2019707334MaRDI QIDQ631753
Joaquín Aguado, Michael Mendler
Publication date: 14 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.007
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Reconciling statechart semantics ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructive Boolean circuits and the exactness of timed ternary simulation
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Automata, logics, and infinite games. A guide to current research
- Locus Solum: From the rules of logic to the logic of rules
- Games and full completeness for multiplicative linear logic
- On the synthesis of strategies in infinite games
- What is in a step: On the semantics of statecharts
- Programming Languages and Systems
- Hazard Detection in Combinational and Sequential Switching Circuits
- The intuitionism behind Statecharts steps
- Decidability of DPDA equivalence
- Equivalences of Statecharts
This page was built for publication: Constructive semantics for instantaneous reactions