The computational complexity of scenario-based agent verification and design

DOI10.1016/j.jal.2005.12.013zbMath1122.68066OpenAlexW2098069058MaRDI QIDQ2372186

Yves Bontemps, Pierre-Yves Schobbens

Publication date: 25 July 2007

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2005.12.013

zbMATH Keywords

synthesiscomputational complexitymodel checkingscenarioslive sequence chartsstrategiesAUML

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in artificial intelligence (68T01)

Related Items (2)

Scenario-based verification of real-time systems using UPPAAL ⋮ Some Results on the Expressive Power and Complexity of LSCs

Uses Software

• SPIN
• AgentSpeak

Cites Work

• The complexity of achievement and maintenance problems in agent-based systems
• Automata-theoretic techniques for modal logics of programs
• Statecharts: a visual formalism for complex systems
• On the complexity of verifying concurrent transition systems
• Undecidable problems of decentralized observation and control on regular languages
• Relationships between nondeterministic and deterministic tape complexities
• SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics
• Alternation
• Alternating Tree Automata and Parity Games
• Modular refinement of hierarchic reactive machines
• Solving Sequential Conditions by Finite-State Strategies
• LATIN 2004: Theoretical Informatics
• LSCs: Breathing life into message sequence charts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The computational complexity of scenario-based agent verification and design