LUSTRE: a declarative language for real-time programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Reactive C: an extension of C to program reactive systems
Software—Practice & Experience
Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
A calculus of mobile processes, II
Information and Computation
Introduction to distributed algorithms
Introduction to distributed algorithms
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Timed default concurrent constraint programming
Journal of Symbolic Computation - Special issue: executable temporal logics
Bisimulations for a calculus of broadcasting systems
Theoretical Computer Science
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Trace and testing equivalence on asynchronous processes
Information and Computation
Distributed Algorithms
Communication and Concurrency
IEEE Transactions on Software Engineering
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
ReactiveML: a reactive extension to ML
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Resource control for synchronous cooperative threads
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On Affine Usages in Signal-Based Communication
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
| Hi-index | 0.00 |
The SL synchronous programming model is a relaxation of the Esterel synchronous model where the reaction to the absence of a signal within an instant can only happen at the next instant. In previous work, we have revisited the SL synchronous programming model. In particular, we have discussed an alternative design of the model, introduced a CPS translation to a tail recursive form, and proposed a notion of bisimulation equivalence. In the present work, we extend the tail recursive model with first-order data types obtaining a non-deterministic synchronous model whose complexity is comparable to the one of the π-calculus. We show that our approach to bisimulation equivalence can cope with this extension and in particular that labelled bisimulation can be characterised as a contextual bisimulation.