A rewriting framework and logic for activities subject to regulations

DOI10.1017/S096012951500016XzbMath1364.68333MaRDI QIDQ2973251

Ranko Perovic, Tajana Ban Kirigin, Vivek Nigam, Carolyn L. Talcott, Andrej Scedrov, Max I. Kanovich

Publication date: 3 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Detection and diagnosis of deviations in distributed systems of autonomous agents, On the complexity of verification of time-sensitive distributed systems, On the formalization and computational complexity of resilience problems for cyber-physical systems, A rewriting framework and logic for activities subject to regulations, Bounded memory Dolev-Yao adversaries in collaborative systems, Bounded memory protocols

Uses Software

• Maude

Cites Work

• Bounded memory Dolev-Yao adversaries in collaborative systems
• Collaborative planning with confidentiality
• Permission to speak: a logic for access control and conformance
• Reachability results for timed automata with unbounded data structures
• A framework for proof systems
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Conditional rewriting logic as a unified model of concurrency
• A theory of timed automata
• Logic programming in a fragment of intuitionistic linear logic
• Cut-elimination for a logic with definitions and induction
• Bounded memory protocols
• Abstraction and Completeness for Real-Time Maude
• A rewriting framework and logic for activities subject to regulations
• On the Complexity of Linear Authorization Logics
• Reasoning about Conditions and Exceptions to Laws in Regulatory Conformance Checking
• Alternation
• Logic Programming with Focusing Proofs in Linear Logic
• The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
• Formal Methods for the Design of Real-Time Systems
• Least and Greatest Fixed Points in Linear Logic
• Unnamed Item