A logical study of distributed transition systems

DOI10.1006/inco.1995.1078zbMath0832.68075OpenAlexW2026388404MaRDI QIDQ1893730

P. S. Thiagarajan, Rohit Parikh, Ramaswamy Ramanujam, Kamal Lodaya

Publication date: 1 August 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3f2b148c514766a4bb7720815451c4f7c013d991

zbMATH Keywords

asynchronous transition systemsdistributed transition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Petri nets, traces, and local model checking, Unnamed Item, Keeping track of the latest gossip in a distributed system, Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals, The dark side of interval temporal logic: marking the undecidability border, Deciding global partial-order properties, Difficult configurations -- on the complexity of LTrL, Models and logics for true concurrency., An expressively complete linear time temporal logic for Mazurkiewicz traces, Knowledge and Local Actions, Logic in India -- editorial introduction, Petri nets, traces, and local model checking, Prompt Interval Temporal Logic, Synthesising elementary net systems with localities