Programming in Timed Concurrent Constraint Languages
NATO ASI series. Series F : Computer and system sciencesPublished 1 January 1994
Vijay Saraswat, Radha Jagadeesan, Vinheet Gupta
Citations40
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The areas of Qualitative Reasoning about physical systems, reasoning about action and state change, reactive, realtime computing and concurrent programming languages are areas of inquiry that are fundamentally about the same subject matter — the representation, design and analysis of continuous and discrete dynamical systems.
Abstract
The areas of Qualitative Reasoning about physical systems (Weld and de Kleer 1989), reasoning about action and state change (Ginsberg 1987), reactive, realtime computing (Real-time systems 1991) and concurrent programming languages (Milner 1980; Hoare 1985) are areas of inquiry that are fundamentally about the same subject matter — the representation, design and analysis of continuous and discrete dynamical systems.
Keywords
Computer Science
Compilers: Principles, Techniques, and Tools
8,137 Citations1986Alfred V. Aho, Ravi Sethi +1 more
This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.
Communication and Concurrency
6,859 Citations1989Robin Milner
This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
Science of Computer ProgrammingStatecharts: a visual formalism for complex systems
6,691 Citations1987David Harel
It is intended to demonstrate here that statecharts counter many of the objections raised against conventional state diagrams, and thus appear to render specification by diagrams an attractive and plausible approach.
Science of Computer ProgrammingThe Esterel synchronous programming language: design, semantics, implementation
1,715 Citations1992Gérard Berry, Georges Gonthier
This paper presents the imperative primitives of E esterel and the temporal manipulations they permit, and shows how the E Esterel v2 and V3 compilers efficiently translate concurrent E esteretl programs into efficient equivalent sequential automata that can be implemented in conventional sequential languages.
Imperative functional programming
1,235 Citations1993Simon Jones, Philip Wadler
A new model, based on monads, for performing input/output in a non-strict, purely functional language that is composable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language working and in-place array updates.
Theoretical Computer ScienceCalculi for synchrony and asynchrony
898 Citations1983Robin Milner
It is shown that the author's Calculus of Communicating Systems (1980), which is an asynchronous model, is derivable from the calculus presented here, which models both synchronous and asynchronous computation.
On the Development of Reactive Systems
836 Citations1985David Harel, Amir Pnueli
The recently proposed statechart method is recommended for finding satisfactory methods for behavioral description in reactive systems, observing that most reactive systems cannot be developed in a linear stepwise fashion, but, rather, give rise to a two-dimensional development process, featuring behavioral aspects in the one dimension and implementational ones in the other.
Lecture notes in computer scienceSynchronous programming of reactive systems
773 Citations1998Nicolas Halbwachs
This book presents a synthesis of recent works concerning reactive system design, based on Robin Milner's pioneering works about synchronous process algebras, which consists in considering that a program instantaneously reacts to events, or that the machine execution time is negligible with respect to the response delays of its environment.
Proceedings of the IEEEProgramming real-time applications with SIGNAL
538 Citations1991P. LeGuernic, Thierry Gautier +2 more
The authors present the main features of the SIGNAL language and its compiler, and the equational approach is a natural way to derive multiprocessor executions of a program.
Proceedings of the IEEEThe ESTEREL language
442 Citations1991Frédéric Boussinot, Rosaria Simone
The authors present the basics of the ESTEREL reactive model of synchronous parallel systems, based on instantaneous communications and decisions, and it is shown how programs can be compiled into finite state sequential machines for efficient execution.
Lecture notes in computer scienceExecuting temporal logic programs
393 Citations1985Ben Moszkowski
This paper presents temporal logic as a tool for reasoning about computer programs, digital circuits and message-passing systems and investigates its role as an adjunct to existing languages.
The semantic foundations of concurrent constraint programming
381 Citations1991Vijay Saraswat, Martin Rinard +1 more
The basic ideas involved in giving a coherent semantic account of concurrent constraint programming are developed, including a simple and general formulation of the notion that a constraint system is a system of partial information.
Building problem solvers
361 Citations1993Kenneth D. Forbus, Johan de Kleer
Although Building Problem Solvers is designed primarily as a text for advanced AI classes or AI programming classes, it can be used by researchers in universities and industrial laboratories who want to apply these techniques in their work, and by programmers whowant to incorporate these ideas in their applications.
The chemical abstract machine
275 Citations1990Gérard Berry, Gérard Boudol
A new kind of abstract machine based on the chemical metaphor used in the Γ language of Banâtre & al. is introduced, which shows how to extract a higher-order concurrent λ-calculus out of the basic concepts of the chemical abstract machine.
National Conference on Artificial IntelligenceDefault reasoning, nonmonotonic logics, and the frame problem
265 Citations1986Steve Hanks, Drew McDermott
Lecture notes in computer scienceA timed model for communicating sequential processes
200 Citations1986G. M. Reed, A. W. Roscoe
A hierarchy of temporal properties
186 Citations1987Zohar Manna, Amir Pnueli
A classification of temporal properties into a hierarchy which refines the known safety-liveness classification of properties, and recognizes the classes of safety, guarantee, persistence, fairness, and hyper-fairness.
Lecture notes in computer scienceMetateM: A framework for programming in temporal logic
132 Citations1990Howard Barringer, Michael Fisher +3 more
This paper further develops the methodology of temporal logic as an executable imperative language, presented by Moszkowski and Gabbay and presents a concrete framework, called MetateM for executing (modal and) temporal logics.
Communicating reactive processes
119 Citations1993Gérard Berry, S. Ramesh +1 more
A new programming paradigm called Communicating Reactive Processes or CRP is presented that unifies the capabilities of asynchronous and synchronous concurrent programming languages and faithfully extends both ESTEREL and CSP and adds new possibilities such as precise local watchdogs on rendezvous.
Lecture notes in computer sciencePreemption in concurrent systems
101 Citations1993Gérard Berry
This work formally presents the preemption operators of the Esterel zero-delay process calculus, which is a theoretical version of the esterel synchronous programming language.
Calculus of Communicating Systems
89 Citations1991C. J. Koomen
The Calculus of Communicating Systems is meant as a formal mathematical framework which can be used to specify communicating systems and to verify properties of them.
The category of constraint systems is Cartesian-closed
50 Citations2003Vijay Saraswat
It is shown that the category is Cartesian-closed, and other usual functors over Scott information systems (lifting, sums, Smyth power-domain) are also definable and recursive domain equations involving these functors can be solved.
Temporal logic programming is complete and expressive
50 Citations1989Marianne Baudinet
It is shown how propositional TEMPLOG programs can be translated into a temporal fixpoint calculus and it is proved that they can express essentially all regular properties of sequences.
ToxinsTemporal Logic Programming and its Relation to Constraint Logic Programming.
25 Citations1991Christoph Brzoska
Experiments in artificially reared nontoxic specimens of Takifugu pardalis and Pao suvattii using tetrodotoxin and paralytic shellfish poison revealed that TTX/PSP selectivity differs between the marine species T. pardonalis and the freshwater species P. suVattii.