Foundations of timed concurrent constraint programming

Saraswat, Vijay; Jagadeesan, Radha; Gupta, Vineet

doi:10.1109/lics.1994.316085

Cited by 88 publications

(135 citation statements)

References 14 publications

Supporting

Mentioning

134

Contrasting

Order By: Relevance

“…Timed ccp (tcc) (Saraswat et al 1994) extends ccp for reactive systems. Time is conceptually divided into time intervals (or time-units).…”

Section: Reactive Systems and Timed Ccpmentioning

confidence: 99%

“…The call p( t) reduces to P [ t/ x]. Recursive calls in P are assumed to be guarded by a next process to avoid non-terminating sequences of recursive calls during a time-unit (see (Saraswat et al 1994;Nielsen et al 2002a)). …”

Section: Definition 2 (Tcc Processes)mentioning

confidence: 99%

“…This combination allows ccp to benefit from the large body of reasoning techniques of both process calculi and logic. In fact, ccp-based calculi have successfully been used in the modeling and verification of several concurrent scenarios such as biological, security, timed, reactive and stochastic systems (Saraswat et al 1991;Olarte and Valencia 2008b;Nielsen et al 2002a;Saraswat et al 1994;Jagadeesan et al 2005) (see a survey in (Olarte et al 2013)). …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Abstract interpretation of temporal concurrent constraint programs

Falaschi¹,

Olarte²,

Palamidessi³

2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e. systems that continuously interact with the environment. The universal tcc formalism (utcc) is an extension of tcc with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. In this paper we consider the denotational semantics for tcc, and we extend it to a "collecting" semantics for utcc based on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses of tcc and utcc programs by abstract interpretation techniques. The concrete and abstract semantics we propose are compositional, thus allowing us to reduce the complexity of data flow analyses. We show that our method is sound and parametric with respect to the abstract domain. Thus, different analyses can be performed by instantiating the framework. We illustrate how it is possible to reuse abstract domains previously defined for logic programming to perform, for instance, a groundness analysis for tcc programs. We show the applicability of this analysis in the context of reactive systems. Furthermore, we make also use of the abstract semantics to exhibit a secrecy flaw in a security protocol. We also show how it is possible to make an analysis which may show that tcc programs are suspension free. This can be useful for several purposes, such as for optimizing compilation or for debugging.

show abstract

“…Timed ccp (tcc) (Saraswat et al 1994) extends ccp for reactive systems. Time is conceptually divided into time intervals (or time-units).…”

Section: Reactive Systems and Timed Ccpmentioning

confidence: 99%

Section: Definition 2 (Tcc Processes)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Abstract interpretation of temporal concurrent constraint programs

Falaschi¹,

Olarte²,

Palamidessi³

2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…Furthermore, temporal and probabilistic extensions of CCP have been proposed to deal with the notion of discrete time [14] and probabilistic behavior [6]. For instance, it is possible to delay one time unit the execution of P as in next P and to choose with a probability ρ (resp.…”

Section: The Modeling Languagementioning

confidence: 99%

Modeling Cellular Signaling Systems: An Abstraction-Refinement Approach

Hermith

Olarte

Rueda

et al. 2011

5th International Conference on Practical Applications of Computational Biology &Amp; Bioinformatics (PACBB 2011)

View full text Add to dashboard Cite

The molecular mechanisms of cell communication with the environment involve many concurrent processes governing dynamically the cell function. This concurrent behavior makes traditional methods, such as differential equations, unsatisfactory as a modeling strategy since they do not scale well when a more detailed view of the system is required. Concurrent Constraint Programming (CCP) is a declarative model of concurrency closely related to logic for specifying reactive systems, i.e., systems that continuously react with the environment. Agents in CCP interact by telling and asking information represented as constraints (e.g., x > 42). In this paper we describe a modeling strategy for cellular signaling systems based on a temporal and probabilistic extension of CCP. Starting from an abstract model, we build refinements adding further details coming from experimentation or abstract assumptions. The advantages of our approach are: due to the notion of partial information as constraints in CCP, the model can be straightforwardly extended when more information is available; qualitative and quantitative information can be represented by means of probabilistic constructs of the language; finally, the model is a runnable specification and can be executed, thus allowing for the simulation of the system. We outline the use of this methodology to model the interaction of G-protein-coupled receptors with their respective G-proteins that activates signaling pathways inside the cell. We also present simulation results obtained from an implementation of the framework.

show abstract

“…Examples are Boussinot's Reactive-C [9], Boussinot and de Simone's synchronous reactive calculus SL [12], Mandel and Pouzet's functional reactive programming language ReactiveML [45], and Boussinot and Dabrowski's FunLoft [11] which is a globally asynchronous, locally synchronous model of multi-threading. The idea is also applied in logic programming, specifically in Saraswat, Jagadeesan and Gupta's language tcc for timed concurrent constraint programming [53].…”

Section: Related Workmentioning

confidence: 99%

What Is in a Step: New Perspectives on a Classical Question

Roever

Lüttgen

Mendler

2010

Time for Verification

View full text Add to dashboard Cite

Abstract. In their seminal 1991 paper "What is in a Step: On the Semantics of Statecharts", Pnueli and Shalev showed how, in the presence of global consistency and while observing causality, the synchronous language Statecharts can be given coinciding operational and declarative step semantics. Over the past decade, this semantics has been supplemented with order-theoretic, denotational, axiomatic and game-theoretic characterisations, thus revealing itself as a rather canonical interpretation of the synchrony hypothesis. In this paper, we survey these characterisations and use them to emphasise the close but not widely known relations of Statecharts to the synchronous language Esterel and to the field of logic programming. Additionally, we highlight some early reminiscences on Amir Pnueli's contributions to characterise the semantics of Statecharts.

show abstract

Foundations of timed concurrent constraint programming

Cited by 88 publications

References 14 publications

Abstract interpretation of temporal concurrent constraint programs

Abstract interpretation of temporal concurrent constraint programs

Modeling Cellular Signaling Systems: An Abstraction-Refinement Approach

What Is in a Step: New Perspectives on a Classical Question

Contact Info

Product

Resources

About