Models and logics for true concurrency.

DOI10.1007/BF02811341zbMath1075.68604OpenAlexW1977335813MaRDI QIDQ5955751

Madhavan Mukund, Kamal Lodaya, P. S. Thiagarajan, Ramaswamy Ramanujam

Publication date: 18 February 2002

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02811341

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in artificial intelligence (68T27) Logic in computer science (03B70)

Related Items (3)

Decidability of a partial order based temporal logic ⋮ Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions ⋮ REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for communicating systems
• Some behavioural aspects of net theory
• Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
• Concurrent histories: a basis for observing distributed systems
• Modeling concurrency with partial orders
• Concurrent transition systems
• Petri nets, event structures and domains. I
• Decidability for branching time
• A logical characterization of well branching event structures
• A logical study of distributed transition systems
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Process algebra for synchronous communication
• Notes on finite asynchronous automata
• Algebraic laws for nondeterminism and concurrency
• Concurrent dynamic logic
• A Proof System for Communicating Sequential Processes
• A Perspective in Theoretical Computer Science
• TEMPORAL LOGICS FOR COMMUNICATING SEQUENTIAL AGENTS: I
• An axiomatic basis for computer programming

This page was built for publication: Models and logics for true concurrency.