TY - JOUR
AU1 - Akshay, S.
AU2 - Bollig, Benedikt
AU3 - Gastin, Paul
AB - We are interested in modeling behaviors and verifying properties of systems in which time and concurrency play a crucial role. We introduce a model of distributed automata which are equipped with event clocks as in Alur et al. (Theor Comput Sci 211:253–273, 1999), which we call Event Clock Message Passing Automata (ECMPA). To describe the behaviors of such systems we use timed partial orders (modeled as message sequence charts with timing).
TI - Event clock message passing automata: a logical characterization and an emptiness checking algorithm
JF - Formal Methods in System Design
DO - 10.1007/s10703-012-0179-8
DA - 2012-12-08
UR - https://www.deepdyve.com/lp/springer-journals/event-clock-message-passing-automata-a-logical-characterization-and-an-1gE804p1S7
SP - 262
EP - 300
VL - 42
IS - 3
DP - DeepDyve
ER -