Kamal Lodaya, Madhavan Mukund and R Ramanujam, Institute of Mathematical Sciences, Chennai.

• Preface, Modular Synthesis of Petri Nets from Regular Languages, On the Reducibility of Persistent Petri Nets, On Extensions of Timed Automata, Scheduling Stochastic Branching Processes, Local Safety and Local Liveness for Distributed Systems, Eliminating Past Operators in Metric Temporal Logic, Static Deadlock Prevention in Dynamically Configured Communication Networks, Reachability and Boundedness in Time-Constrained MSC Graphs, Test Generation for Integrated System Models Capturing State-based and MSC-based Notations, How Hard is Smart Play-Out? On the Complexity of Verification-Driven Execution, Symmetry in Petri Nets, Steps and Coverability in Inhibitor Nets, Probabilistic Computational Trust, Folding Systems of Communicating Agents, Decidable Logics for Event Structures, A Look at the Control of Asynchronous Automata, A Sampling Approach to the Analysis of Metric Temporal Logic, Abstract Switches: A Distributed Model of Communication and Computation, Dynamic Logic of Tree Composition, Axiomatization of a Class of Parametrised Bisimilarities, Path Logics with Synchronization, Logic-Based Diagnosis for Distributed Systems.

Select Guide Rating

Kamal Lodaya, Madhavan Mukund and R Ramanujam, Institute of Mathematical Sciences, Chennai.

• Preface, Modular Synthesis of Petri Nets from Regular Languages, On the Reducibility of Persistent Petri Nets, On Extensions of Timed Automata, Scheduling Stochastic Branching Processes, Local Safety and Local Liveness for Distributed Systems, Eliminating Past Operators in Metric Temporal Logic, Static Deadlock Prevention in Dynamically Configured Communication Networks, Reachability and Boundedness in Time-Constrained MSC Graphs, Test Generation for Integrated System Models Capturing State-based and MSC-based Notations, How Hard is Smart Play-Out? On the Complexity of Verification-Driven Execution, Symmetry in Petri Nets, Steps and Coverability in Inhibitor Nets, Probabilistic Computational Trust, Folding Systems of Communicating Agents, Decidable Logics for Event Structures, A Look at the Control of Asynchronous Automata, A Sampling Approach to the Analysis of Metric Temporal Logic, Abstract Switches: A Distributed Model of Communication and Computation, Dynamic Logic of Tree Composition, Axiomatization of a Class of Parametrised Bisimilarities, Path Logics with Synchronization, Logic-Based Diagnosis for Distributed Systems.

Select Guide Rating

Kamal Lodaya, Madhavan Mukund and R Ramanujam, Institute of Mathematical Sciences, Chennai.

• Preface, Modular Synthesis of Petri Nets from Regular Languages, On the Reducibility of Persistent Petri Nets, On Extensions of Timed Automata, Scheduling Stochastic Branching Processes, Local Safety and Local Liveness for Distributed Systems, Eliminating Past Operators in Metric Temporal Logic, Static Deadlock Prevention in Dynamically Configured Communication Networks, Reachability and Boundedness in Time-Constrained MSC Graphs, Test Generation for Integrated System Models Capturing State-based and MSC-based Notations, How Hard is Smart Play-Out? On the Complexity of Verification-Driven Execution, Symmetry in Petri Nets, Steps and Coverability in Inhibitor Nets, Probabilistic Computational Trust, Folding Systems of Communicating Agents, Decidable Logics for Event Structures, A Look at the Control of Asynchronous Automata, A Sampling Approach to the Analysis of Metric Temporal Logic, Abstract Switches: A Distributed Model of Communication and Computation, Dynamic Logic of Tree Composition, Axiomatization of a Class of Parametrised Bisimilarities, Path Logics with Synchronization, Logic-Based Diagnosis for Distributed Systems.

Select Guide Rating