Transactional Reduction of Component Compositions

DOI10.1007/978-3-540-73196-2_22zbMath1215.68067OpenAlexW1703523649MaRDI QIDQ3612363

Pascal Poizat, Serge Haddad

Publication date: 10 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73196-2_22

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• LTSA-WS
• Antichains

Cites Work

• Unnamed Item
• Unnamed Item
• A calculus for reasoning about software composition
• Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
• Formal methods for software architectures. Third international school on formal methods for the design of computer communication and software systems: Software architectures, SFM 2003, Bertinoro, Italy, September 22--27, 2003. Advanced lectures.
• Static Analysis
• Antichains: A New Algorithm for Checking Universality of Finite Automata

This page was built for publication: Transactional Reduction of Component Compositions