# A Logical Study of Distributed Transition Systems

@article{Lodaya1995ALS, title={A Logical Study of Distributed Transition Systems}, author={Kamal Lodaya and Rohit Parikh and Ramaswamy Ramanujam and P. S. Thiagarajan}, journal={Inf. Comput.}, year={1995}, volume={119}, pages={91-118} }

We extend labelled transition systems to distributed transition systems by labelling the transition relation with a finite set of actions, representing the fact that the actions occur as a concurrent step. We design an addition-based temporal logic in which one can explicity talk about steps. The logic is studied to establish a variety of positive and negative results in terms of axiomatizability and decidability. Our positive results show that the step notion is amenable to logical treatment…

## 71 Citations

Distributed States Temporal Logic

- Computer ScienceArXiv
- 2003

A temporal logic to reason on global applications in an asynchronous setting, and provides the logic with a sound and complete axiomatization, so that it is possible to reason about properties that involve several components, even in the absence of a global clock.

A Trace Based Extension of Linear Time Temporal Logic

- Computer Science
- 1994

This work designs a natural extension of PTL called TrPTL to be interpreted directly over infinite traces and solves the model checking problem for TkPTL with respect to finite state concurrent programs.

Modal Logic over Higher Dimensional Automata ( extended abstract ) ⋆

- Computer Science
- 2010

This work introduces and develops a modal logic over HDAs which incorporates two modalities for reasoning about “during” and “after”, and proves that HDML is decidable using an extension of the filtration technique.

A trace based extension of linear time temporal logic

- Computer ScienceProceedings Ninth Annual IEEE Symposium on Logic in Computer Science
- 1994

This work designs a natural extension of PTL called TrPTL to be interpreted directly over infinite traces and shows that the satisfiability problem for TrPTl is decidable, and solves the model checking problem forTrPTL with respect to finite state concurrent programs.

Modal logic over higher dimensional automata

- Computer Science, PhilosophyCONCUR 2010
- 2010

This paper introduces and investigates a modal logic over HDAs which incorporates two modalities for reasoning about "during" and "after", and proves that this general higher dimensional modal Logic (HDML) is decidable and defines a complete axiomatic system for it.

Deciding Global Partial-Order Properties

- Computer ScienceFormal Methods Syst. Des.
- 1998

A decision procedure for a partial order temporal logic over global states is presented and it is shown that a single until operator is sufficient for undecidability.

Automata for Epistemic Temporal Logic with Synchronous Communication

- Computer ScienceJ. Log. Lang. Inf.
- 2010

We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is…

Higher Dimensional Modal Logic

- Computer Science, Philosophy
- 2014

This paper introduces and investigates a modal logic over HDAs which incorporates two modalities for reasoning about “during” and “after”, and proves that this general higher dimensional modal Logic (HDML) is decidable and defines an axiomatic system for it.

Logics and Automata for Verification: Expressiveness and Decidability Issues

- Computer Science
- 2000

This dissertation investigates and extends the mathematical foundations of logics and automata for the interleaving and synchronous noninterleaving view of system computations with an emphasis on…

## References

SHOWING 1-10 OF 51 REFERENCES

A logic for distributed transition systems

- Computer ScienceREX Workshop
- 1988

This work presents a logical characterization of a particular aspect of concurrency called the concurrent step notion, and implies that satisfiability in the logical system is decidable.

Concurrent Histories: A Basis for Observing Distributed Systems

- Computer ScienceJ. Comput. Syst. Sci.
- 1987

Models for Concurrency

- Computer ScienceMFCS
- 1991

This is a draft version of a chapter for the Handbook of Logic and the Foundations of Computer Science, Oxford University Press. The final draft can be found as DAIMI PB 463. It surveys a range of…

Event Structures

- Computer ScienceAdvances in Petri Nets
- 1986

The mathematical theory of event structures is presented, how they are related to Petri nets and Scott domains, and how they can be used to provide semantics to programming languages for parallel processes as welt as languages with higher types are surveyed.

Basic notions of trace theory

- Computer Science, MathematicsREX Workshop
- 1988

The theory of traces can be used as a tool for reasoning about nets and it is hoped that applying this theory one can get a calculus of the concurrent processes analogous to that available for sequential systems.

On Undecidability of Propositional Temporal Logics on Trace Systems

- Computer ScienceInf. Process. Lett.
- 1992

Petri Nets, Event Structures and Domains

- Computer ScienceSemantics of Concurrent Computation
- 1979

The general aim of the paper is to find a theory of concurrency combining the approaches of Petri and Scott, and to connect the abstract ideas of events and domains of information, by showing how causal nets induce certain kinds of domains where the information points are certain sets of events.

Algebraic laws for nondeterminism and concurrency

- Computer ScienceJACM
- 1985

The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.

Concurrency and Automata on Infinite Sequences

- Computer ScienceTheoretical Computer Science
- 1981

A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.