Checking conformance for time-constrained scenario-based specifications

Akshay, S.; Gastin, Paul; Mukund, Madhavan; Kumar, K. Narayan

doi:10.1016/j.tcs.2015.03.030

Cited by 4 publications

(11 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Time properties Several works study properties of timed formalisms, especially in the contexts of automata [KY06a,KY06b] and MSC [GMNK09,AGMK10]. In the timed scenario, problems such as reachability are known to be undecidable in the general case.…”

Section: Tractable Verification Of Distributed Systemsmentioning

confidence: 99%

“…The work in [AGMK10], focused on an extension of MSCs with timed events, is particularly related to [BYY14a] (on which theory this article is based): the former focuses on the problem of language inclusion while the latter on statically checking conformance of abstract session types with concrete programs. The work in [AGMK10] gives a verification method that is decidable when the communication graph describing the behaviour of each loop can be modelled as a single strongly connected component, which implies that channels have an upper bound.…”

Section: Tractable Verification Of Distributed Systemsmentioning

confidence: 99%

“…The work in [AGMK10] gives a verification method that is decidable when the communication graph describing the behaviour of each loop can be modelled as a single strongly connected component, which implies that channels have an upper bound. In this article we hinge at the theory for static checking from [BYY14a] but practically apply it to dynamic checking.…”

Section: Tractable Verification Of Distributed Systemsmentioning

confidence: 99%

See 2 more Smart Citations

Timed runtime monitoring for multiparty conversations

2017

View full text Add to dashboard Cite

Abstract. We propose a dynamic verification framework for protocols in real-time distributed systems. The framework is based on Scribble, a tool-chain for design and verification of choreographies based on multiparty session types, which we have developed with our industrial partners. Drawing from recent work on multiparty session types for real-time interactions, we extend Scribble with clocks, resets, and clock predicates in order to constrain the times in which interactions occur. We present a timed API for Python to program distributed implementations of Scribble specifications. A dynamic verification framework ensures the safe execution of applications written with our timed API: we have implemented dedicated runtime monitors that check that each interaction occurs at a correct timing with respect to the corresponding Scribble specification. To demonstrate the practicality of the proposed framework, we express and verify four categories of widely used temporal patterns from use cases in literature. We analyse the performance of our implementation via benchmarking and show negligible overhead.

show abstract

Section: Tractable Verification Of Distributed Systemsmentioning

confidence: 99%

Section: Tractable Verification Of Distributed Systemsmentioning

confidence: 99%

Section: Tractable Verification Of Distributed Systemsmentioning

confidence: 99%

See 1 more Smart Citation

Timed runtime monitoring for multiparty conversations

2017

View full text Add to dashboard Cite

show abstract

“…By protocol, we intend application-level specifications of interaction patterns (via message passing) among distributed applications. An extensive literature offers theories and tools for formal analysis of timed protocols, modelled for instance as timed automata [3,26,34] or Message Sequence Charts [2]. These works allow to reason on the properties of protocols, defined as formal models.…”

Section: Introductionmentioning

confidence: 99%

“…The model in (1) is not wait-free: the intersection of the time-windows for the send and receive actions is non-empty (the timewindows actually coincide). The protocol in (2), where the server must wait until after the client's deadline to read the message, is wait-free.…”

Section: Introductionmentioning

confidence: 99%

Asynchronous Timed Session Types

Bocchi

Murgia

Vasconcelos

et al. 2019

Programming Languages and Systems

View full text Add to dashboard Cite

We present a behavioural typing system for a higher-order timed calculus using session types to model timed protocols. Behavioural typing ensures that processes in the calculus perform actions in the timewindows prescribed by their protocols. We introduce duality and subtyping for timed asynchronous session types. Our notion of duality allows typing a larger class of processes with respect to previous proposals. Subtyping is critical for the precision of our typing system, especially in the presence of session delegation. The composition of dual (timed asynchronous) types enjoys progress when using an urgent receive semantics, in which receive actions are executed as soon as the expected message is available. Our calculus increases the modelling power of extant calculi on timed sessions, adding a blocking receive primitive with timeout and a primitive that consumes an arbitrary amount of time in a given range.

show abstract

Reachability of Communicating Timed Processes

Clemente

Herbreteau

Stainer

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of local clocks; all clocks evolve at the same rate. Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time. We also obtain complexity results, by showing that communicating timed processes are at least as hard as Petri nets; in the discrete time, we also show equivalence with Petri nets. Our results follow from mutual topology-preserving reductions between timed automata and (untimed) counter automata.

show abstract

Checking conformance for time-constrained scenario-based specifications

Cited by 4 publications

References 23 publications

Timed runtime monitoring for multiparty conversations

Timed runtime monitoring for multiparty conversations

Asynchronous Timed Session Types

Reachability of Communicating Timed Processes

Contact Info

Product

Resources

About