Some Results on the Expressive Power and Complexity of LSCs

DOI10.1007/978-3-540-78127-1_19zbMath1133.68375OpenAlexW2168957591MaRDI QIDQ5452186

Itai Segall, Shahar Maoz, David Harel

Publication date: 25 March 2008

Published in: Pillars of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78127-1_19

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of scenario-based agent verification and design
• Relationships between nondeterministic and deterministic tape complexities
• On the Expressive Power of Live Sequence Charts
• The complexity of propositional linear temporal logics
• Automated Technology for Verification and Analysis
• Tools and Algorithms for the Construction and Analysis of Systems
• Foundations of Software Science and Computational Structures
• Formal Methods in Software and Systems Modeling
• Computational Methods in Systems Biology
• Check It Out: On the Efficient Formal Verification of Live Sequence Charts
• LSCs: Breathing life into message sequence charts

This page was built for publication: Some Results on the Expressive Power and Complexity of LSCs