A theory of regular MSC languages

Henriksen, Jesper G.; Mukund, Madhavan; Kumar, K. Narayan; Sohoni, Milind; Thiagarajan, P. S.

doi:10.1016/j.ic.2004.08.004

Cited by 69 publications

(51 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As observed in [1,6,12,16] it is often convenient to describe the runs of such systems as a state-labeling of words decorated with a matching relation per data-structure instead of the traditional operational semantics using configurations and moves. This will prove all the more useful when we move to the distributed setting where traditionally semantics has always been given as state-labelings of appropriate partial orders [8,10,18].…”

Section: Systems With Stacks and Queuesmentioning

confidence: 99%

See 1 more Smart Citation

Controllers for the Verification of Communicating Multi-pushdown Systems

Aiswarya

Gastin

Kumar

2014

CONCUR 2014 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. Multi-pushdowns communicating via queues are formal models of multi-threaded programs communicating via channels. They are turing powerful and much of the work on their verification has focussed on under-approximation techniques. Any error detected in the underapproximation implies an error in the system. However the successful verification of the under-approximation is not as useful if the system exhibits unverified behaviours. Our aim is to design controllers that observe/restrict the system so that it stays within the verified underapproximation. We identify some important properties that a good controller should satisfy. We consider an extensive under-approximation class, construct a distributed controller with the desired properties and also establish the decidability of verification problems for this class.

show abstract

Section: Systems With Stacks and Queuesmentioning

confidence: 99%

“…Related Work: In the study of distributed automata a number of difficult synthesis theorems [8][9][10]18] have been proved. These theorems in conjunction with constructions for intersections yield controllers for these classes.…”

Section: Introductionmentioning

confidence: 99%

Controllers for the Verification of Communicating Multi-pushdown Systems

Aiswarya

Gastin

Kumar

2014

CONCUR 2014 – Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…While Cvpa recognize sets of nested traces, a visibly pushdown CFM would give rise to the notion of a nested message sequence chart. Interestingly, there are theorems for CFMs that constitute counterparts of Zielonka's Theorem [12,14].…”

Section: Future Directionsmentioning

confidence: 99%

Realizability of Concurrent Recursive Programs

Bollig

Grindei

Habermehl

2009

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multi-stack visibly pushdown automata and Zielonka's asynchronous automata towards a model with an undecidable emptiness problem. However, a reasonable restriction allows us to lift Zielonka's Theorem to this recursive setting and permits a logical characterization in terms of a suitable monadic second-order logic. Building on results from Mazurkiewicz trace theory and work by La Torre, Madhusudan, and Parlato, we thus develop a framework for the specification, synthesis, and verification of concurrent recursive processes.

show abstract

“…The second setting can relate clocks from different processes and specify how long a communication can or must take [2,1,5,6]. However, these papers restrict the concurrency in a structural way, for instance considering only locally synchronized (see [14,4,10]) MSC graphs (in [2,1]) or only safe Petri Nets (in [5,6]). The language of the specification is then forced to be regular, which is a significant restriction in a concurrent setting where even simple behaviors may not be regular (e.g., the producer-consumer protocol).…”

Section: Introductionmentioning

confidence: 99%

Symbolically Bounding the Drift in Time-Constrained MSC Graphs

Akshay

Genest

Hélouët

et al. 2012

Theoretical Aspects of Computing – ICTAC 2012

View full text Add to dashboard Cite

Systems involving both time and concurrency are notoriously difficult to analyze. Existing decidability results apply in settings where clocks on different processes cannot be compared or where the set of timed executions is regular. We prove new decidability results for timed concurrent systems, requiring neither restriction. We consider the formalism of time-constrained MSC graphs (TC-MSC graphs for short), introduced in [2]. We study the problem of checking whether the set of timed executions generated by a TC-MSC graph is empty, which is undecidable in general [9].In this paper, we show the decidability of this problem under the restriction that every path of the TC-MSC graph is prohibited from forcing any basic scenario labeling a node to take more than K units of time to complete, for a given K. Further, we prove that this condition can be effectively checked. Our approach consists in encoding the time constraints seen along a path into a bounded system of inequalities. Instead of constructing an interleaved model and using zones of timed automata as in existing approaches, we symbolically manipulate the system of inequalities using the Fourier-Motzkin elimination method. This allows for decision procedures which are both efficient and handle non regular specifications. IntroductionIn a distributed system, several processes interact to implement a collection of global behaviors. Protocol specifications include timing requirements for messages as well as descriptions of how to recover from timeouts. Thus, a protocol designer has to deal with situations where time and concurrency influence each other. One way to describe these interactions is through scenarios, formalized using Message Sequence Charts (MSCs) [11]. The timing information is captured by adding timing constraints between pairs of events, yielding time-constrained MSCs (denoted TC-MSCs). A protocol is then described by allowing choices and repetition of scenarios. To specify these main characteristics of protocols while abstracting away details of implementation, the formal methods community often considers MSC graphs, which are directed graphs whose nodes are labeled by MSCs. MSC graphs have been generalized to time-constrained MSC graphs (TC-MSC graphs) [2], whose nodes are labeled by TC-MSCs and edges have additional timing constraints. In general, such models do not have regular sets of executions. In this paper, we consider decidability issues for TC-MSC graphs.Obtaining decidability in the presence of both time and concurrency is a challenging issue. For instance, even checking whether there exists a timed execution that is consistent with all the constraints of a model is non trivial. This question, called the emptiness problem, is undecidable for TC-MSC graphs in general [9]. However, it is decidable for (sequential) timed automata [3]. Extending decidability results to distributed systems has been done only in two particular and limited settings. In the first setting, [13,8] consider clocks that are local to a process. But then,...

show abstract

A theory of regular MSC languages

Cited by 69 publications

References 34 publications

Controllers for the Verification of Communicating Multi-pushdown Systems

Controllers for the Verification of Communicating Multi-pushdown Systems

Realizability of Concurrent Recursive Programs

Symbolically Bounding the Drift in Time-Constrained MSC Graphs

Contact Info

Product

Resources

About