38 search results - page 4 / 8 » Non-interleaving bisimulation equivalences on Basic Parallel... |
107
click to vote
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we have developed an operational semantic framework for a non-trival subset of Verilog which features event–driven computation, shared variable concurrency. The b...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
CONCUR
1999
Springer
15 years 1 months ago
1999
Springer
Statecharts is a visual language for specifying the behavior of reactive systems. The language extends nite-state machines with concepts of hierarchy, concurrency, and priority. De...
83
Voted
CSL
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...