A local-time semantics for negotiations

DOI10.1007/978-3-031-42626-1_7MaRDI QIDQ6536431

Adwitee Roy, Madhavan Mukund, B. Srivathsan

Publication date: 3 May 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient emptiness check for timed Büchi automata
• A theory of timed automata
• Negotiation as concurrency primitive
• Timed negotiations
• Relationships between nondeterministic and deterministic tape complexities
• A partial order semantics approach to the clock explosion problem of timed automata
• Timed Unfoldings for Networks of Timed Automata
• Symbolic Unfoldings for Networks of Timed Automata
• Checking Coverage for Infinite Collections of Timed Scenarios
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: A local-time semantics for negotiations